Automata, languages and programming : fourth colloquium, University of Turku, Finland, July 18-22, 1977
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
52 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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, fourth colloquium, University of Turku, Finland, July 18-22, 1977, edited by Arto Salomaa and Magnus Steinby, 1977, Berlin, Springer, 1 vol. (X-569 p.), Lecture notes in computer science, 0-387-08342-1 • Automata, Languages and Programming, Texte imprimé, 9783662195536 |
| LEADER | 04675nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 945621 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155234722 | ||
| 020 | |a 9783540373056 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 001.642 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a International Colloquium on automata, languages and programming |n (04 |d :1977 |c :Turku, Finlande). | |
| 245 | 1 | 0 | |a Automata, languages and programming : |b fourth colloquium, University of Turku, Finland, July 18-22, 1977 |c edited by Arto Salomaa and Magnus Steinby. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 52 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a How hard is compiler code generation? -- "Natural" complexity measures and time versus memory: Some definitional proposals -- Semantics and proof theory of pascal procedures -- On the structure of combinatorial problems and structure preserving reductions -- Factor graphs, failure functions and Bi-Trees -- Parallel decomposition of LR(k) parsers -- Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata -- Termination tests inside ?-calculus -- On the computational power of reversal-bounded machines -- The contextsensitivity bounds of contextsensitive grammars and languages -- Serial composition of 2-way finite-state transducers and simple programs on strings -- The sequence equivalence problem for dol systems is decidable -- Languages defined by higher type program schemes -- Parsing and syntactic error recovery for context-free grammars by means of coarse structures -- On three types of unambiguity of context-free language -- The mathematics of record handling -- Macro grammars, lindenmayer systems and other copying devices -- On the time and tape complexity of hyper(1)-AFL's -- Renaming and erasing in szilard languages -- Some matching problems -- Complexite des demi Groupes de matrices -- On the proper treatment or referencing, dereferencing and assignment -- Complexity of some problems concerning L systems -- Left-fitting translations -- Dynamic binary search -- About the derivation languages of grammars and machines -- Simple chain grammars -- Time-space trade-offs in a pebble game -- Non-deterministic polynomial optimization problems and their approximation -- Simple programs and their decision problems -- Theory of data structures by relational and graph grammars -- On backtracking and greatest fixpoints -- L systems of finite index -- The safety of acoroutine system -- Linear time simulation of multihead turing machines with head To-head jumps -- Data types as objects -- On the difference between one and many -- On defining error recovery in context-free parsing -- LL(k) languages are closed under union with finite languages -- The time and tape complexity of developmental languages -- Rational relations of binary trees -- Structural equivalence of context-free grammar forms is decidable -- On the definition of classes of interpretations. | |
| 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 Actes de congrès | ||
| 700 | 1 | |a Salomaa, Arto, |d 1934-2025. |4 pbd | |
| 700 | 1 | |a Steinby, Magnus. |4 pbd | |
| 776 | 0 | |0 018211437 |t Automata, languages and programming |o fourth colloquium, University of Turku, Finland, July 18-22, 1977 |f edited by Arto Salomaa and Magnus Steinby |d 1977 |c Berlin |n Springer |p 1 vol. (X-569 p.) |s Lecture notes in computer science |z 0-387-08342-1 | |
| 776 | 0 | |t Automata, Languages and Programming |b Texte imprimé |z 9783662195536 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-08342-1 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-37PSZR4J-3 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747908923 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-08342-1 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750921854 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-08342-1 |z Accès INSA CVL | |
| 997 | |0 945621 |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/ | ||