Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings: 62 (Lecture Notes in Computer Science, 62) - Softcover
Synopsis
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Automata, Languages and Programming: Fifth Colloquium,...
Stock Image
Automata, Languages and Programming: Proceedings of Fifth Colloquium; Udine, Italy; July 17-21, 1978. Volume 62, Lecture Notes in Computer Science.
Published by
Springer-Verlag, OHG, Berlin, Germany, 1978
ISBN 10: 3540088601
ISBN 13: 9783540088608
Used
Paperback
First Edition
Seller: SUNSET BOOKS 2, Newark, OH, U.S.A.
Seller rating 4 out of 5 stars
Paperback. Condition: Good. No Jacket. 1st. Wear/soil. W/full markings and pocket. 507 numbered pages, 510 for Amz. Size: 8vo Size: 8vo - over 7¾ - 9¾" tall. Ex-Library. Seller Inventory # 009047
Seller Image
Automata, languages and programming; Fifth Colloquium, Udine July 1978; Lecture notes in computer science ; 62
Published by
Berlin ; Heidelberg [u.a.] : Springer, 1978
ISBN 10: 3540088601
ISBN 13: 9783540088608
Used
Broschiert
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
Broschiert. Condition: Gut. 508 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); leichte altersbedingte Anbräunung des Papiers; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 840. Seller Inventory # 1805346
Seller Image
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings (Lecture Notes in Computer Science) (English and French Edition)
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. 0387088601 Ex-Library hardcover no dj (red boards) in very nice condition with all the usual markings and attachments. Seller Inventory # DA1412884
Stock Image
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings (Lecture Notes in Computer Science, 62)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020158263
Seller Image
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings (Lecture Notes in Computer Science)
Seller: NEPO UG, Rüsselsheim am Main, Germany
Seller rating 5 out of 5 stars
Condition: Gut. Auflage: 1978. 520 Seiten ex Library Book aus einer wissenschafltichen Bibliothek Sprache: Englisch Gewicht in Gramm: 969 24,1 x 16,5 x 2,3 cm, Taschenbuch. Seller Inventory # 368674
Stock Image
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings (Lecture Notes in Computer Science, 62)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540088608_new
Buy New
£ 49.30
Shipping:
£ 11.98
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Automata, Languages and Programming : Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540088608
Buy New
£ 47.99
Shipping:
£ 15.49
From United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1978, 1978
ISBN 10: 3540088601
ISBN 13: 9783540088608
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 -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.- Multiterminal network 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. 520 pp. Englisch. Seller Inventory # 9783540088608
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, 1978
ISBN 10: 3540088601
ISBN 13: 9783540088608
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 d. Seller Inventory # 4880203
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1978, 1978
ISBN 10: 3540088601
ISBN 13: 9783540088608
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.- Multiterminal network 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 520 pp. Englisch. Seller Inventory # 9783540088608