Automata Languages and Programming - neues Buch

EAN (ISBN-13): 9783540393085
Erscheinungsjahr: 2006
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-06-04T14:01:05+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-31T10:32:34+02:00 (Zurich)
ISBN/EAN: 9783540393085

ISBN - alternative Schreibweisen:
978-3-540-39308-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: schmidt

---

Daten vom Verlag:

Autor/in: M. Nielsen; E. M. Schmidt
Titel: Lecture Notes in Computer Science; Automata, Languages and Programming - Ninth Colloquium Aarhus, Denmark, July 12–16, 1982
Verlag: Springer; Springer Berlin
615 Seiten
Erscheinungsjahr: 2005-11-23
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
VII, 616 p.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; Approximation; Notation; algebra; algorithms; automata; complexity; forcing; grammar; homomorphism; logic; programming; programming language; proof; semantics; term rewriting; algorithm analysis and problem complexity; C; Algorithms; Formal Languages and Automata Theory; Computer Science; Theoretische Informatik; BC

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 theequivalence 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.