Automata, Languages and Programming: 11th Colloquium Antwerp, Belgium, July 16–20, 1984

The theory of data dependencies — An overview....Pages 1-22
The VLSI revolution in theoretical circles....Pages 23-40
Tuple sequences and indexes....Pages 41-50
The complexity of cubical graphs....Pages 51-57
P-generic sets....Pages 58-68
Functional dependencies and disjunctive existence constraints in database relations with null values....Pages 69-81
The algebra of recursively defined processes and the algebra of regular processes....Pages 82-94
Algebraic specification of exception handling and error recovery by means of declarations and equations....Pages 95-108
Building the minimal DFA for the set of all subwords of a word on-line in linear time....Pages 109-118
The complexity and decidability of separation....Pages 119-127
Concurrent transmissions in broadcast networks....Pages 128-136
Linear searching for a square in a word....Pages 137-137
Domain algebras....Pages 138-150
Principality results about some matrix languages families....Pages 151-161
Oriented equational clauses as a programming language....Pages 162-173
Relational algebra operations and sizes of relations....Pages 174-186
Some results about finite and infinite behaviours of a pushdown automaton....Pages 187-195
On the relationship of CCS and petri nets....Pages 196-208
Communicating finite state machines with priority channels....Pages 209-221
A modal characterization of observational congruence on finite terms of CCS....Pages 222-234
Communication complexity....Pages 235-246
Space and time efficient simulations and characterizations of some restricted classes of PDAS....Pages 247-259
A complete axiom system for algebra of closed-regular expression....Pages 260-269
The complexity of finding minimum-length generator sequences....Pages 270-280
On probabilistic tape complexity and fast circuits for matrix inversion problems....Pages 281-291
On three-element codes....Pages 292-302
Recursion depth analysis for special tree traversal algorithms....Pages 303-311
Performance analysis of Shamir\'s attack on the basic Merkle-Hellman knapsack cryptosystem....Pages 312-323
Measures of presortedness and optimal sorting algorithms....Pages 324-336
Languages and inverse semigroups....Pages 337-346
Area-time optimal vlsi integer multiplier with minimum computation time....Pages 347-357
On the interpretation of infinite computations in logic programming....Pages 358-370
A linear time algorithm to solve the single function coarsest partition problem....Pages 371-379
Complexité des facteurs des mots infinis engendrés par morphismes itérés....Pages 380-389
Automates boustrophedon, semi-groupe de birget et monoide inversif libre....Pages 390-390
Probabilistic bidding gives optimal distributed resource allocation....Pages 391-402
Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness....Pages 403-413
Cancellation, pumping and permutation in formal languages....Pages 414-422
A hardware implementation of the CSP primitives and its verification....Pages 423-435
Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm....Pages 436-447
Robust algorithms: A different approach to oracles....Pages 448-453
Node weighted matching....Pages 454-464
The propositional mu-calculus is elementary....Pages 465-472
AVL-trees for localized search....Pages 473-485
The simple roots of real-time computation hierarchies....Pages 486-489
Computational complexity of an optical disk interface....Pages 490-502
Encoding graphs by derivations and implications for the theory of graph grammars....Pages 503-513
Sampling algorithms for differential batch retrieval problems (extended abstract)....Pages 514-526