Automata, Languages, and Programming: Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings - Couverture souple
Synopsis
Automates, langues et programmation : sixième colloque, Graz, Autriche, 16-20 juillet 1979. Proceedings Automata, Languages, and Programming : Sixième Colloque, Graz, Autriche, 16-20 juillet 1979. Procédures
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Automata, Languages, and Programming: Sixth Colloquium,...
Image d'archives
Automata, Languages, and Programming: Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings (Lecture Notes in Computer Science) (English and French Edition)
Edité par
Springer, 1979
ISBN 10 : 3540095101
ISBN 13 : 9783540095101
Ancien ou d'occasion
Paperback
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding. N° de réf. du vendeur UTD14a2626
Acheter D'occasion
EUR 15,89
Frais de port :
EUR 6,01
Vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, languages and programming. Lecture notes in computer science.
Edité par
Berlin, Springer, 1979
ISBN 10 : 3540095101
ISBN 13 : 9783540095101
Ancien ou d'occasion
Softcover
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Softcover. IX, 684 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 3540095101 Sprache: Englisch Gewicht in Gramm: 1145. N° de réf. du vendeur 2396619
Acheter D'occasion
EUR 13
Frais de port :
EUR 40
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages, and Programming: Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings (Lecture Notes in Computer Science) Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings
Edité par
Springer, 1979
ISBN 10 : 3540095101
ISBN 13 : 9783540095101
Ancien ou d'occasion
Couverture souple
Vendeur : NEPO UG, Rüsselsheim am Main, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Gut. Auflage: 1979. 700 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 2115 23,5 x 15,5 x 4,0 cm, Taschenbuch. N° de réf. du vendeur 368179
Acheter D'occasion
EUR 104,11
Frais de port :
EUR 24
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Automata, Languages, and Programming: Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings (Lecture Notes in Computer Science, 71)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020158535
Acheter neuf
EUR 131,30
Frais de port :
EUR 3,43
Vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Automata, Languages, and Programming
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1979, 1979
ISBN 10 : 3540095101
ISBN 13 : 9783540095101
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Sharing in nondeterminism.- Sur les mots sans carr¿¿nis par un morphisme.- A characterization of abstract data as model-theoretic invariants.- Inherent ambiguities in families of grammars extended abstract.- Representing complexity classes by equality sets.- Supercounter machines.- Existential quantifiers in abstract data types.- A generalization of Ginsburg and Rose's characterization of G-S-M mappings.- Strict deterministic languages and controlled rewriting systems.- A string matching algorithm fast on the average.- Functional characterization of some semantic equalities inside -calculus.- Arbitration and queueing under limited shared storage requirements.- On the homomorphic characterizations of families of languages.- Two level grammars: CF-grammars with equation schemes.- Proving termination with multiset orderings.- One abstract accepting algorithm for all kinds of parsers.- Studies in abstract/concrete mappings in proving algorithm correctness.- A characterization of a dot-depth two analogue of generalized definite languages.- Partitioned LL(k) grammars.- Recursion schemes and generalized interpretations.- A rational theory of AFLs.- On the succinctness of different representations of languages.- A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs.- Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons.- A unique termination theorem for a theory with generalised commutative axioms.- Dags and Chomsky hierarchy.- Recent advances in the probabilistic analysis of graph-theoretic algorithms.- On the average stack size of regularly distributed binary trees.- On reductions of parallel programs.- On the height of derivation trees.- The modal logic of programs.- A comparison between two variations of a pebble game on graphs.- LL(k) parsing for attributed grammars.- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space.- Structure preserving transformations on non-left-recursive grammars.- The complexity of restricted minimum spanning tree problems.- A systematic approach to formal language theory through parallel rewriting.- Extending the notion of finite index.- On the complexity of general context-free language parsing and recognition.- Space-time tradeoffs for oblivious integer multiplication.- Investigating programs in terms of partial graphs.- On the power of random access machines.- An axiomatic treatment of ALGOL 68 routines.- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP.- Constructing call-by-value continuation semantics.- A formal semantics for concurrent systems.- On constructing LL(k) parsers.- More on advice on structuring compilers and proving them correct.- Languages of nilpotent and solvable groups (extended abstract).- Unique fixed points vs. least fixed points.- A modification of the LR(k) method for constructing compact bottom-up parsers.- Optimal decomposition of linear automata.- Bracketed two-level grammars ¿ A decidable and practical approach to language definitions. 700 pp. Englisch. N° de réf. du vendeur 9783540095101
Acheter neuf
EUR 139,09
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Automata, Languages, and Programming
Edité par
Springer Berlin Heidelberg, 1979
ISBN 10 : 3540095101
ISBN 13 : 9783540095101
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 4880485
Acheter neuf
EUR 118,61
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Automata, Languages, and Programming | Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Automata, Languages, and Programming | Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings | H. A. Maurer | Taschenbuch | xii | Englisch | 1979 | Springer | EAN 9783540095101 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 102158519
Acheter neuf
EUR 123,10
Frais de port :
EUR 70
De Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image fournie par le vendeur
Automata, Languages, and Programming
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1979, 1979
ISBN 10 : 3540095101
ISBN 13 : 9783540095101
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Sharing in nondeterminism.- Sur les mots sans carr¿¿nis par un morphisme.- A characterization of abstract data as model-theoretic invariants.- Inherent ambiguities in families of grammars extended abstract.- Representing complexity classes by equality sets.- Supercounter machines.- Existential quantifiers in abstract data types.- A generalization of Ginsburg and Rose's characterization of G-S-M mappings.- Strict deterministic languages and controlled rewriting systems.- A string matching algorithm fast on the average.- Functional characterization of some semantic equalities inside -calculus.- Arbitration and queueing under limited shared storage requirements.- On the homomorphic characterizations of families of languages.- Two level grammars: CF-grammars with equation schemes.- Proving termination with multiset orderings.- One abstract accepting algorithm for all kinds of parsers.- Studies in abstract/concrete mappings in proving algorithm correctness.- A characterization of a dot-depth two analogue of generalized definite languages.- Partitioned LL(k) grammars.- Recursion schemes and generalized interpretations.- A rational theory of AFLs.- On the succinctness of different representations of languages.- A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs.- Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons.- A unique termination theorem for a theory with generalised commutative axioms.- Dags and Chomsky hierarchy.- Recent advances in the probabilistic analysis of graph-theoretic algorithms.- On the average stack size of regularly distributed binary trees.- On reductions of parallel programs.- On the height of derivation trees.- The modal logic of programs.- A comparison between two variations of a pebble game on graphs.- LL(k) parsing for attributed grammars.- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space.- Structure preserving transformations on non-left-recursive grammars.- The complexity of restricted minimum spanning tree problems.- A systematic approach to formal language theory through parallel rewriting.- Extending the notion of finite index.- On the complexity of general context-free language parsing and recognition.- Space-time tradeoffs for oblivious integer multiplication.- Investigating programs in terms of partial graphs.- On the power of random access machines.- An axiomatic treatment of ALGOL 68 routines.- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP.- Constructing call-by-value continuation semantics.- A formal semantics for concurrent systems.- On constructing LL(k) parsers.- More on advice on structuring compilers and proving them correct.- Languages of nilpotent and solvable groups (extended abstract).- Unique fixed points vs. least fixed points.- A modification of the LR(k) method for constructing compact bottom-up parsers.- Optimal decomposition of linear automata.- Bracketed two-level grammars ¿ A decidable and practical approach to language definitions.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 700 pp. Englisch. N° de réf. du vendeur 9783540095101
Acheter neuf
EUR 139,09
Frais de port :
EUR 60
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages, and Programming : Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg, 1979
ISBN 10 : 3540095101
ISBN 13 : 9783540095101
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Sharing in nondeterminism.- Sur les mots sans carr¿¿nis par un morphisme.- A characterization of abstract data as model-theoretic invariants.- Inherent ambiguities in families of grammars extended abstract.- Representing complexity classes by equality sets.- Supercounter machines.- Existential quantifiers in abstract data types.- A generalization of Ginsburg and Rose's characterization of G-S-M mappings.- Strict deterministic languages and controlled rewriting systems.- A string matching algorithm fast on the average.- Functional characterization of some semantic equalities inside -calculus.- Arbitration and queueing under limited shared storage requirements.- On the homomorphic characterizations of families of languages.- Two level grammars: CF-grammars with equation schemes.- Proving termination with multiset orderings.- One abstract accepting algorithm for all kinds of parsers.- Studies in abstract/concrete mappings in proving algorithm correctness.- A characterization of a dot-depth two analogue of generalized definite languages.- Partitioned LL(k) grammars.- Recursion schemes and generalized interpretations.- A rational theory of AFLs.- On the succinctness of different representations of languages.- A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs.- Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons.- A unique termination theorem for a theory with generalised commutative axioms.- Dags and Chomsky hierarchy.- Recent advances in the probabilistic analysis of graph-theoretic algorithms.- On the average stack size of regularly distributed binary trees.- On reductions of parallel programs.- On the height of derivation trees.- The modal logic of programs.- A comparison between two variations of a pebble game on graphs.- LL(k) parsing for attributed grammars.- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space.- Structure preserving transformations on non-left-recursive grammars.- The complexity of restricted minimum spanning tree problems.- A systematic approach to formal language theory through parallel rewriting.- Extending the notion of finite index.- On the complexity of general context-free language parsing and recognition.- Space-time tradeoffs for oblivious integer multiplication.- Investigating programs in terms of partial graphs.- On the power of random access machines.- An axiomatic treatment of ALGOL 68 routines.- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP.- Constructing call-by-value continuation semantics.- A formal semantics for concurrent systems.- On constructing LL(k) parsers.- More on advice on structuring compilers and proving them correct.- Languages of nilpotent and solvable groups (extended abstract).- Unique fixed points vs. least fixed points.- A modification of the LR(k) method for constructing compact bottom-up parsers.- Optimal decomposition of linear automata.- Bracketed two-level grammars ¿ A decidable and practical approach to language definitions. N° de réf. du vendeur 9783540095101
Acheter neuf
EUR 139,09
Frais de port :
EUR 65,21
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Automata, Languages, and Programming
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 700. N° de réf. du vendeur 263094245
Acheter neuf
EUR 244,98
Frais de port :
EUR 3,43
Vers Etats-Unis
Quantité disponible : 4 disponible(s)