9783540108542 - fundamentals of computation theory: proceedings of the 1981 international fct-conference, szeged, hungaria, august 24-28, 1981: 117 di gecseg, f. (19 risultati)
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 56,06
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 58,42
Spedizione gratuitaSpedito in U.S.A.Quantità: 5 disponibili
Paperback or Softback. Condizione: New. Fundamentals of Computation Theory: Proceedings of the 1981 International Fct-Conference, Szeged, Hungaria, August 24-28, 1981. Book.
- Brossura
Da: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,51
Spedizione gratuitaSpedito in U.S.A.Quantità: 10 disponibili
Condizione: Brand New. New. Delivery takes 25-30 days. Excellent Customer Service.
- Brossura
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 60,54
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 62,36
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 61,18
EUR 14,01 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: Chiron Media, Wallingford, Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 57,67
EUR 18,11 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 10 disponibili
PF. Condizione: New.
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,65
EUR 17,54 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 80,36
EUR 3,45 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 488.
- Brossura
Da: Roland Antiquariat UG haftungsbeschränkt, Weinheim, GermaniaRoland Antiquariat UG haftungsbeschränkt
Contatta il venditoreVenditore con 5 stelleCondizione: Usato
EUR 40,00
EUR 42,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Softcover. 1981. 471 p. ATTENTION 1981 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540108542 Sprache: Englisch Gewicht in Gramm: 816.
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 67,34
EUR 17,54 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 63,67 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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 problem…s.- 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.
Altre immagini- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 50,40
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Fundamentals of Computation Theory | Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981 | F. Gecseg | Taschenbuch | xi | Englisch | 1981 | Springer | EAN 9783540108542 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelbe…rg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Brossura
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Molto buono
EUR 115,62
EUR 29,23 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: 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 combi…natorial 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.
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 79,56
EUR 7,60 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: 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.
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 80,19
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 488.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,37
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: 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 c…lasses of combinatorial problems.- Modera.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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 combinato…rial 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 488 pp. Englisch.
