Fundamentals of Computation Theory -

Fundamentals of Computation Theory

Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981

F. Gecseg (Herausgeber)

Buch | Softcover
XI, 471 Seiten
1981 | 1981
Springer Berlin (Verlag)
978-3-540-10854-2 (ISBN)
53,49 inkl. MwSt

Observability and Nerode equivalence in concrete categories.- Some universal algebraic and model theoretic results in computer science.- Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems.- Moderately exponential bound for graph isomorphism.- An algebraic definition of attributed transformations.- Analogies of PAL and COPY.- Quasi-equational logic for partial algeras.- Homogeneity and completeness.- On the error correcting power of pluralism in inductive inference.- Equality languages and language families.- Extremal combinatorial problems in relational data base.- Specifying algebraic data types by domain equations.- An axiomatization of regular forests in the language of algebraic theories with iteration.- Fast recognition of rings and lattices.- A definition of the P = NP-problem in categories.- Generating graph languages using hypergraph grammars.- Lower bounds for problems defined by polynomial inequalities.- What is computable for abstract data types ?.- On strongly cube-free ?-words generated by binary morphisms.- On the role of selectors in selective substitution grammars.- Classes of functions over binary trees.- Mathematical structures underlying greedy algorithms.- Some properties of language families generated by commutative languages.- Isomorphism completeness for some algebraic structures.- Reducing algebraic tree grammars.- Rational cone and substitution.- On the regularity problem of SF-languages generated by minimal linear grammars.- Co-algebras as machines for the interpretations of flow diagrams.- Random access machines and straight-line programs.- On the LBA problem.- Dynamic algebras of programs.- The equivalence problem for LL- and LR-regular grammars.- Context-free languages of infinitewords as least fixpoints.- Remarks on the notion of concurrency relation in the case of systems.- On the size of conjunctive representations of n-ary relations.- On subwords of formal languages.- First order dynamic logic with decidable proofs and workable model theory.- Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures.- Processes in Petri nets.- Some algebraic aspects of recognizability and rationality.- Pebbling and bandwidth.- On cellular graph-automata and second-order definable graph-properties.- Extensions of symmetric hom-functors to the Kleisli category.- A new operation between languages.- Logical description of computation processes.- An algorithm to identify slices, with applications to vector replacement systems.- One pebble does not suffice to search plane labyrinths.- About the by codings of environments induced posets [µ z, ?] and [?z, ?].- The complexity of automata and subtheories of monadic second order arithmetics.- Tape complexity of word problems.

Erscheint lt. Verlag 1.8.1981
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo XI, 471 p.
Verlagsort Berlin
Sprache englisch
Maße 170 x 244 mm
Gewicht 790 g
Themenwelt Informatik Software Entwicklung User Interfaces (HCI)
Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik
Schlagworte algorithm • algorithms • Automata • Automatentheorie • Complexity • Computation • Computer • Computer Science • formal language • Informatik • Logic • Petri net
ISBN-10 3-540-10854-8 / 3540108548
ISBN-13 978-3-540-10854-2 / 9783540108542
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Aus- und Weiterbildung nach iSAQB-Standard zum Certified Professional …

von Mahbouba Gharbi; Arne Koschel; Andreas Rausch; Gernot Starke

Buch | Hardcover (2023)
dpunkt Verlag
34,90
Wissensverarbeitung - Neuronale Netze

von Uwe Lämmel; Jürgen Cleve

Buch | Hardcover (2023)
Carl Hanser (Verlag)
34,99