Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
71 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automata, languages and programming, sixth colloquium, Graz, Austria, July 16-20, 1979, edited by Hermann A. Maurer, Berlin, Springer-Verlag, 1979, 1 vol. (IX-684 p.), Lecture notes in computer science, 3-540-09510-1 • Automata, Languages, and Programming, Texte imprimé, 9783662191903 |
| LEADER | 05554nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 944319 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155183613 | ||
| 020 | |a 9783540351689 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International colloquium on automata, languages and programming |n (06 |d :1979 |c :Graz, Autriche). | |
| 245 | 1 | 0 | |a Automata, languages and programming : |b sixth colloquium, Graz, Austria, July 16-20, 1979 |c edited by Hermann A. Maurer. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 71 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Sharing in nondeterminism -- Sur les mots sans carré définis par un morphisme -- A characterization of abstract data as model-theoretic invariants -- Inherent ambiguities in families of grammars extended abstract -- Representing complexity classes by equality sets -- Supercounter machines -- Existential quantifiers in abstract data types -- A generalization of Ginsburg and Rose's characterization of G-S-M mappings -- Strict deterministic languages and controlled rewriting systems -- A string matching algorithm fast on the average -- Functional characterization of some semantic equalities inside ?-calculus -- Arbitration and queueing under limited shared storage requirements -- On the homomorphic characterizations of families of languages -- Two level grammars: CF-grammars with equation schemes -- Proving termination with multiset orderings -- One abstract accepting algorithm for all kinds of parsers -- Studies in abstract/concrete mappings in proving algorithm correctness -- A characterization of a dot-depth two analogue of generalized definite languages -- Partitioned LL(k) grammars -- Recursion schemes and generalized interpretations -- A rational theory of AFLs -- On the succinctness of different representations of languages -- A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs -- Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons -- A unique termination theorem for a theory with generalised commutative axioms -- Dags and Chomsky hierarchy -- Recent advances in the probabilistic analysis of graph-theoretic algorithms -- On the average stack size of regularly distributed binary trees -- On reductions of parallel programs -- On the height of derivationtrees -- The modal logic of programs -- A comparison between two variations of a pebble game on graphs -- LL(k) parsing for attributed grammars -- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space -- Structure preserving transformations on non-left-recursive grammars -- The complexity of restricted minimum spanning tree problems -- A systematic approach to formal language theory through parallel rewriting -- Extending the notion of finite index -- On the complexity of general context-free language parsing and recognition -- Space-time tradeoffs for oblivious integer multiplication -- Investigating programs in terms of partial graphs -- On the power of random access machines -- An axiomatic treatment of ALGOL 68 routines -- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP -- Constructing call-by-value continuation semantics -- A formal semantics for concurrent systems -- On constructing LL(k) parsers -- More on advice on structuring compilers and proving them correct -- Languages of nilpotent and solvable groups (extended abstract) -- Unique fixed points vs. least fixed points -- A modification of the LR(k) method for constructing compact bottom-up parsers -- Optimal decomposition of linear automata -- Bracketed two-level grammars A decidable and practical approach to language definitions. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Langages formels | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Théorie des machines séquentielles | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Maurer, Hermann A., |d 1941- |4 pbd | |
| 776 | 0 | |0 019235283 |t Automata, languages and programming |o sixth colloquium, Graz, Austria, July 16-20, 1979 |f edited by Hermann A. Maurer |c Berlin |n Springer-Verlag |d 1979 |p 1 vol. (IX-684 p.) |s Lecture notes in computer science |z 3-540-09510-1 | |
| 776 | 0 | |t Automata, Languages, and Programming |b Texte imprimé |z 9783662191903 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-09510-1 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-B19MBZJG-9 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747920753 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-09510-1 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750933216 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-09510-1 |z Accès INSA CVL | |
| 997 | |0 944319 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||