Automata, Languages and Programming

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Simple EOL forms under uniform interpretation generating CF languages
3. Altmetric Badge
   Chapter 2 Codes : Unequal probabilities, unequal letter costs
4. Altmetric Badge
   Chapter 3 Sur l'inversion des morphismes d'arbres
5. Altmetric Badge
   Chapter 4 Grammars with dynamic control sets
6. Altmetric Badge
   Chapter 5 Ambiguite forte
7. Altmetric Badge
   Chapter 6 Relationship between density and deterministic complexity of MP-complete languages
8. Altmetric Badge
   Chapter 7 Stable Models of Typed lambda-Calculi.
9. Altmetric Badge
   Chapter 8 Path measures of turing machine computations
10. Altmetric Badge
    Chapter 9 Une famille remarquable de codes indecomposables
11. Altmetric Badge
    Chapter 10 Comparisons and reset machines
12. Altmetric Badge
    Chapter 11 Size — Depth tradeoff in boolean formulas
13. Altmetric Badge
    Chapter 12 (Semi)-separability of finite sets of terms in Scott's D ∞ -models of the λ-calculus
14. Altmetric Badge
    Chapter 13 Mutual exclusion of N processors using an O(N)-valued message variable
15. Altmetric Badge
    Chapter 14 On the power of self-application and higher type recursion
16. Altmetric Badge
    Chapter 15 Time and space bounds for selection problems
17. Altmetric Badge
    Chapter 16 Stepwise specification and implementation of abstract data types
18. Altmetric Badge
    Chapter 17 The complexity of equivalence and containment for free single variable program schemes
19. Altmetric Badge
    Chapter 18 On improving the worst case running time of the Boyer-Moore string matching algorithm
20. Altmetric Badge
    Chapter 19 Semantics and correctness of nondeterministic flowchart programs with recursive procedures
21. Altmetric Badge
    Chapter 20 Arithmetical completeness in logics of programs
22. Altmetric Badge
    Chapter 21 Covering a graph by circuits
23. Altmetric Badge
    Chapter 22 A pspace complete problem related to a pebble game
24. Altmetric Badge
    Chapter 23 Some effective results about linear recursive sequences
25. Altmetric Badge
    Chapter 24 On the parsing and covering of simple chain grammars
26. Altmetric Badge
    Chapter 25 Sur un cas particulier de la conjecture de Cerny
27. Altmetric Badge
    Chapter 26 States can sometimes do more than stack symbols in PDA's
28. Altmetric Badge
    Chapter 27 Some decision results for recognizable sets in arbitrary monoids
29. Altmetric Badge
    Chapter 28 Sur les series rationnelles en variables non commutatives
30. Altmetric Badge
    Chapter 29 On constructing efficient evaluators for attribute grammars
31. Altmetric Badge
    Chapter 30 Une extension de la theorie des types en λ-calcul
32. Altmetric Badge
    Chapter 31 Parallel and nondeterministic time complexity classes
33. Altmetric Badge
    Chapter 32 Multiterminal network flow and connectivity in unsymmetrical networks
34. Altmetric Badge
    Chapter 33 Admissible coherent c.p.o.'s
35. Altmetric Badge
    Chapter 34 Integration of the phase-difference relations in asynchronous sequential networks
36. Altmetric Badge
    Chapter 35 Self-modifying nets, a natural extension of Petri nets
37. Altmetric Badge
    Chapter 36 Head recurrent terms in combinatory logic : A generalization of the notion of head normal form
38. Altmetric Badge
    Chapter 37 Characterization problems in the theory of inductive inference