Automata, languages and programming : fifth colloquium, Udine, Italy, July 17-21, 1978
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
62 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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 |
Tabla de Contenidos:
- 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.