Automata, Languages and Programming - neues Buch

EAN (ISBN-13): 9783540387459
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-01-29T17:51:15+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-31T10:32:34+02:00 (Zurich)
ISBN/EAN: 9783540387459

ISBN - alternative Schreibweisen:
978-3-540-38745-9
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: automata

---

Daten vom Verlag:

Autor/in: S. Even; O. Kariv
Titel: Lecture Notes in Computer Science; Automata, Languages and Programming - Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981
Verlag: Springer; Springer Berlin
554 Seiten
Erscheinungsjahr: 2005-06-29
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
X, 554 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Datenverarbeitung; Formale Sprache; Languages; Signatur; Variable; algorithm; algorithms; automata; complexity; database; logic; model theory; programming; term rewriting; verification; algorithm analysis and problem complexity; C; Theory of Computation; Algorithms; Formal Languages and Automata Theory; Computer Science; Algorithmen und Datenstrukturen; BC

Refined analysis and improvements on some factoring algorithms.- Absolute primality of polynomials is decidable in random polynomial time in the number of variables.- Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform.- Cost tradeoffs in graph embeddings, with applications.- Minimum s-t cut of a planar undirected network in o(n log2(n)) time.- On the density of color-families.- The implication problem for data dependencies.- Characterizing data base Dependencies.- Data flow analysis of applicative programs.- Flow analysis of lambda expressions.- Algorithmic specifications of abstract data types.- Nondeterminism in abstract data types.- A view of directions in relational database theory.- A new characterization of the regular languages.- Langages Reconnaissables et Codage Prefixe Pur.- Passes, sweeps and visits.- On LALR(k) testing.- On size bounds for deterministic parsers.- A decision procedure for the equivalence of two dpdas one of which is linear.- The deducibility problem in Propositional Dynamic Logic.- Finite models for deterministic propositional dynamic logic.- Impartiality, justice and fairness: The ethics of concurrent termination.- Computing a perfect strategy for n×n chess requires time exponential in n.- On the complexity of simple arithmetic expressions.- Proving lower bounds for linear decision trees.- Parikh-bounded languages.- Generalized Parikh mappings and homomorphisms.- Chomsky-Schotzenberger representations for families of languages and grammatical types.- Algebraically specified programming systems and Hoare's logic.- Automatic construction of verification condition generators from hoare logics.- Circular expressions: Elimination of static environments.- An axiomatic approach to the Korenjak -Hopcroft algorithms.- On the (generalized) post correspondence problem with lists of length 2.- A sparse table implementation of priority queues.- Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems.- Termination of linear rewriting systems.- Realizing an equational specification.- A cook's tour of countable nondeterminism.- The complexity of decision problems for finite-turn multicounter machines.- Alternating multihead finite automata.- The solution for the branching factor of the alpha-beta pruning algorithm.- Uniform complexity and digital signatures.- On the generation of cryptographically strong pseudo-random sequences.- Measuring the expressive power of dynamic logics: An application of abstract model theory.