Automata, languages, and programming - Info and Reading Options

"Automata, languages, and programming" Table Of Contents:

• 1- Locality in modular systems
• 2- On
• 3- he
• 4- ly garbage collection: New algorithms inspired by program proofs
• 5- Algebraic specifications for parametrized data types with minimal parameter and target algebras
• 6- A modification of the ?
• 7- alculus as a base for functional programming languages
• 8- On the power of nondeterminism in dynamic logic
• 9- Equivalence and membership problems for regular trace languages
• 10- On the power of chain rules in context free grammars
• 11- Extended Chomsky
• 12- chützenberger theorems
• 13- Real time agents
• 14- Machine inductive inference and language identification
• 15- Approximations of infinitary objects
• 16- On test sets and the Ehrenfeucht conjecture
• 17- An automata
• 18- heoretic characterization of the OI
• 19- ierarchy
• 20- Fast detection of polyhedral intersections
• 21- On reversal
• 22- ounded counter machines and on pushdown automata with a bound on the size of the pushdown store
• 23- Multihead finite state automata am concatenation
• 24- Conditions enforcing regularity of context
• 25- ree languages
• 26- Repetitions in homomorphisms and languages
• 27- Parameter passing commutes with implementation of parameterized data types
• 28- An operational semantics for pure dataflow
• 29- Some properties of D
• 30- ontinuous causal nets
• 31- A branching process arising in dynamic hashing, trie searching and polynomial factorization
• 32- A sound and complete HOARE axiomatization of the ADA
• 33- endezvous
• 34- Universal realization, persistent interconnection and implementation of abstract modules
• 35- Heaps on heaps
• 36- A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties
• 37- Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems
• 38- A programming language for the inductive sets, and applications
• 39- A lower bound for the formula size of rational functions
• 40- On the equivalence problem for binary DOL systems
• 41- Results on the propositional ?
• 42- alculus
• 43- An iteration theorem for simple precedence languages
• 44- The power of non
• 45- ectilinear holes
• 46- Fixed
• 47- oint semantics for algebraic (tree) grammars
• 48- Completing biprefix codes
• 49- Advances in pebbling
• 50- A powerdomain for countable non
• 51- eterminism
• 52- Properties of a notation for combining functions
• 53- On the power of probabilistic choice in synchronous parallel computations
• 54- Biprefix codes and semisimple algebras
• 55- Algorithmic theories of data structures
• 56- Implementation of parameterised specifications
• 57- Algebraic semantics of recursive flowchart schemes
• 58- The complexity of promise problems
• 59- Global and local invariants in transition systems
• 60- On relativization and the existence of complete sets
• 61- Semantics of interference control
• 62- Efficient simulations of multicounter machines
• 63- Event structure semantics for CCS and related languages
• 64- Domains for denotational semantics.

Read “Automata, languages, and programming”:

Read “Automata, languages, and programming” by choosing from the options below.