Automata, Languages and Programming - neues Buch

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

Buch in der Datenbank seit 2017-01-29T17:51:17+01:00 (Vienna)
Detailseite zuletzt geändert am 2018-07-06T14:29:42+02:00 (Vienna)
ISBN/EAN: 9783540358077

ISBN - alternative Schreibweisen:
978-3-540-35807-7

---

Daten vom Verlag:

Autor/in: G. Ausiello; C. Böhm
Titel: Lecture Notes in Computer Science; Automata, Languages and Programming - Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings
Verlag: Springer; Springer Berlin
510 Seiten
Erscheinungsjahr: 2005-07-13
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
X, 510 p.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Grundlagen; Mathematik: Logik; Verstehen; Datenverarbeitung; Formale Sprache; Languages; algorithms; automata; calculus; complexity; programming; C; Mathematical Logic and Foundations; Computer Science; Theory of Computation; Computer Science; Mathematische Grundlagen; Informatik; Theoretische Informatik; BC

Simple EOL forms under uniform interpretation generating CF languages.- Codes : Unequal probabilities, unequal letter costs.- Sur l'inversion des morphismes d'arbres.- Grammars with dynamic control sets.- Ambiguite forte.- Relationship between density and deterministic complexity of MP-complete languages.- Stable models of typed ?-calculi.- Path measures of turing machine computations.- Une famille remarquable de codes indecomposables.- Comparisons and reset machines.- Size — Depth tradeoff in boolean formulas.- (Semi)-separability of finite sets of terms in Scott's D?-models of the ?-calculus.- Mutual exclusion of N processors using an O(N)-valued message variable.- On the power of self-application and higher type recursion.- Time and space bounds for selection problems.- Stepwise specification and implementation of abstract data types.- The complexity of equivalence and containment for free single variable program schemes.- On improving the worst case running time of the Boyer-Moore string matching algorithm.- Semantics and correctness of nondeterministic flowchart programs with recursive procedures.- Arithmetical completeness in logics of programs.- Covering a graph by circuits.- A pspace complete problem related to a pebble game.- Some effective results about linear recursive sequences.- On the parsing and covering of simple chain grammars.- Sur un cas particulier de la conjecture de Cerny.- States can sometimes do more than stack symbols in PDA's.- Some decision results for recognizable sets in arbitrary monoids.- Sur les series rationnelles en variables non commutatives.- On constructing efficient evaluators for attribute grammars.- Une extension de la theorie des types en ?-calcul.- Parallel and nondeterministic time complexity classes.- Multiterminalnetwork flow and connectivity in unsymmetrical networks.- Admissible coherent c.p.o.'s.- Integration of the phase-difference relations in asynchronous sequential networks.- Self-modifying nets, a natural extension of Petri nets.- Head recurrent terms in combinatory logic : A generalization of the notion of head normal form.- Characterization problems in the theory of inductive inference.