Automata, Languages and Programming Ninth Colloquium Aarhus, Denmark, July 12–16, 1982
| Other Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1982, 1982
|
| Edition: | 1st ed. 1982 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- An iteration theorem for simple precedence languages
- The power of non-rectilinear holes
- Fixed-point semantics for algebraic (tree) grammars
- Completing biprefix codes
- Advances in pebbling
- A powerdomain for countable non-determinism
- Properties of a notation for combining functions
- On the power of probabilistic choice in synchronous parallel computations
- Biprefix codes and semisimple algebras
- Algorithmic theories of data structures
- Implementation of parameterised specifications
- Algebraic semantics of recursive flowchart schemes
- The complexity of promise problems
- Global and local invariants in transition systems
- On relativization and the existence of complete sets
- Semantics of interference control
- Efficient simulations of multicounter machines
- Event structure semantics for CCS and related languages
- Domains for denotational semantics
- Conditions enforcing regularity of context-free languages
- Repetitions in homomorphisms and languages
- Parameter passing commutes with implementation of parameterized data types
- An operational semantics for pure dataflow
- Some properties of D-continuous causal nets
- A branching process arising in dynamic hashing, trie searching and polynomial factorization
- A sound and complete HOARE axiomatization of the ADA-rendezvous
- Universal realization, persistent interconnection and implementation of abstract modules
- Heaps on heaps
- A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties
- Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems
- A programming language for the inductive sets, and applications
- A lower bound for the formula size of rational functions
- On theequivalence problem for binary DOL systems
- Results on the propositional ?-calculus
- Locality in modular systems
- On-the-fly garbage collection: New algorithms inspired by program proofs
- Algebraic specifications for parametrized data types with minimal parameter and target algebras
- A modification of the ?-calculus as a base for functional programming languages
- On the power of nondeterminism in dynamic logic
- Equivalence and membership problems for regular trace languages
- On the power of chain rules in context free grammars
- Extended Chomsky-Schützenberger theorems
- Real time agents
- Machine inductive inference and language identification
- Approximations of infinitary objects
- On test sets and the Ehrenfeucht conjecture
- An automata-theoretic characterization of the OI-hierarchy
- Fast detection of polyhedral intersections
- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
- Multihead finite state automata am concatenation