Amazon cover image
Image from Amazon.com

Automata, languages, and programming : ninth colloquium, Aarhus, Denmark, July 12-16, 1982 / edited by M. Nielsen and E.M. Schmidt.

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 140.Publication details: Berlin ; New York : Springer-Verlag, 1982.Description: 1 online resource (vii, 613 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540393085
  • 3540393080
Subject(s): Genre/Form: Additional physical formats: Print version:: Automata, languages, and programming.DDC classification:
  • 519.4 19
LOC classification:
  • QA267 .I55 1982
Other classification:
  • 31.80
  • 54.51
  • 54.10
  • SS 4800
Online resources:
Contents:
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 -- 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 the equivalence problem for binary DOL systems -- Results on the propositional?-calculus -- 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.
Action note:
  • digitized 2011 HathiTrust Digital Library committed to preserve
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references and index.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2011. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL

Print version record.

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 -- 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 the equivalence problem for binary DOL systems -- Results on the propositional?-calculus -- 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.

Powered by Koha