Items related to Fundamentals of Computation Theory: Proceedings of...
Fundamentals of Computation Theory: Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981: 117 (Lecture Notes in Computer Science, 117) - Softcover
Synopsis
Fundamentals of Computation Theory: Proceedings of the 1981 International Fct-Conference, Szeged, Hungaria, August 24-28, 1981 Fundamentals of Computation Theory: Proceedings of the 1981 International Fct-Conference, Szeged, Hungaria, August 24-28, 1981
"synopsis" may belong to another edition of this title.
Search results for Fundamentals of Computation Theory: Proceedings of...
Seller Image
Fundamentals of computation theory
Seller: Bookbot, Prague, Czech Republic
Seller rating 5 out of 5 stars
Softcover. Condition: Fair. Spuren von Feuchtigkeit / Nässe; Leichte Risse; Deutliche Verbiegung. Seller Inventory # 00f4f2ba-c237-4751-bf20-4bfa1bc74b04
Quantity: 1 available
Seller Image
Fundamentals of computation theory
Seller: Bookbot, Prague, Czech Republic
Seller rating 5 out of 5 stars
Softcover. Condition: Fair. Unterschrift / Widmung ohne Bezug; Leichte Abnutzungen. Seller Inventory # b4abc133-34f2-4b2b-8ad9-42311c75de04
Quantity: 1 available
Seller Image
Fundamentals of Computation Theory: Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981 (Lecture Notes in Computer Science, 117, Band 117)
Seller: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germany
Seller rating 5 out of 5 stars
Softcover. 1981. 471 p. ATTENTION 1981 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540108542 Sprache: Englisch Gewicht in Gramm: 816. Seller Inventory # 224190
Quantity: 1 available
Stock Image
Fundamentals of Computation Theory: Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981 (Lecture Notes in Computer Science, 117)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540108542_new
Quantity: Over 20 available
Stock Image
Fundamentals of Computation Theory : Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540108542
Quantity: 10 available
Seller Image
Fundamentals of Computation Theory
Published by
Springer Berlin Heidelberg Aug 1981, 1981
ISBN 10: 3540108548
ISBN 13: 9783540108542
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 infinite words 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. 488 pp. Englisch. Seller Inventory # 9783540108542
Quantity: 2 available
Seller Image
Fundamentals of Computation Theory : Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981
Published by
Springer Berlin Heidelberg, 1981
ISBN 10: 3540108548
ISBN 13: 9783540108542
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 infinite words 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. Seller Inventory # 9783540108542
Quantity: 1 available
Seller Image
Fundamentals of Computation Theory
Published by
Springer Berlin Heidelberg, 1981
ISBN 10: 3540108548
ISBN 13: 9783540108542
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.- Modera. Seller Inventory # 4881132
Quantity: Over 20 available
Stock Image
Fundamentals of Computation Theory
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 488 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 5851729
Quantity: 4 available
Stock Image
Fundamentals of Computation Theory
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 488. Seller Inventory # 263077518
Quantity: 4 available