Automata, languages and programming : fifth colloquium, Udine, Italy, July 17-21, 1978
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | , |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
62 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
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, fifth colloquium, Udine, Italy, July 17-21, 1978, edited by G. Ausiello and C. Böhm, 1978, Berlin, Springer-Verlag, 1 vol. (VIII-508 p.), Lecture notes in computer science, 0-387-08860-1 • Automata, Languages and Programming, Texte imprimé, 9783662186626 |
| LEADER | 04607nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 944044 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155172719 | ||
| 020 | |a 9783540358077 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 519.7 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a Colloquium on automata, languages and programming |n (5 |d :1978 |c :Udine, Italie). | |
| 245 | 1 | 0 | |a Automata, languages and programming : |b fifth colloquium, Udine, Italy, July 17-21, 1978 |c edited by G. Ausiello and C. Böhm. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 62 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Simple EOL forms under uniform interpretation generating CF languages -- Codes : Unequal probabilities, unequal letter costs -- Sur l'inversion des morphismes d'arbres -- Grammars with dynamic control sets -- Ambiguite forte -- Relationship between density and deterministic complexity of MP-complete languages -- Stable models of typed ?-calculi -- Path measures of turing machine computations -- Une famille remarquable de codes indecomposables -- Comparisons and reset machines -- Size Depth tradeoff in boolean formulas -- (Semi)-separability of finite sets of terms in Scott's D?-models of the ?-calculus -- Mutual exclusion of N processors using an O(N)-valued message variable -- On the power of self-application and higher type recursion -- Time and space bounds for selection problems -- Stepwise specification and implementation of abstract data types -- The complexity of equivalence and containment for free single variable program schemes -- On improving the worst case running time of the Boyer-Moore string matching algorithm -- Semantics and correctness of nondeterministic flowchart programs with recursive procedures -- Arithmetical completeness in logics of programs -- Covering a graph by circuits -- A pspace complete problem related to a pebble game -- Some effective results about linear recursive sequences -- On the parsing and covering of simple chain grammars -- Sur un cas particulier de la conjecture de Cerny -- States can sometimes do more than stack symbols in PDA's -- Some decision results for recognizable sets in arbitrary monoids -- Sur les series rationnelles en variables non commutatives -- On constructing efficient evaluators for attribute grammars -- Une extension de la theorie des types en ?-calcul -- Parallel and nondeterministic time complexity classes -- Multiterminalnetwork flow and connectivity in unsymmetrical networks -- Admissible coherent c.p.o.'s -- Integration of the phase-difference relations in asynchronous sequential networks -- Self-modifying nets, a natural extension of Petri nets -- Head recurrent terms in combinatory logic : A generalization of the notion of head normal form -- Characterization problems in the theory of inductive inference. | |
| 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 Automates mathématiques, Théorie des | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Ausiello, Giorgio, |d 1941- |4 pbd | |
| 700 | 1 | |a Böhm, Corrado, |d 1923- |4 pbd | |
| 776 | 0 | |0 01872647X |t Automata, languages and programming |o fifth colloquium, Udine, Italy, July 17-21, 1978 |f edited by G. Ausiello and C. Böhm |d 1978 |c Berlin |n Springer-Verlag |p 1 vol. (VIII-508 p.) |s Lecture notes in computer science |z 0-387-08860-1 | |
| 776 | 0 | |t Automata, Languages and Programming |b Texte imprimé |z 9783662186626 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-08860-1 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-S79JSXTR-6 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747923248 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-08860-1 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750935545 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-08860-1 |z Accès INSA CVL | |
| 997 | |0 944044 |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/ | ||