Articoli correlati a Automata, Languages and Programming: Fifth Colloquium,...
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings: 62 - Brossura
Contenuti
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2008
- ISBN 10 3540088601
- ISBN 13 9783540088608
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine520
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 48,37
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Automata, Languages and Programming: Fifth Colloquium,...
Immagini fornite dal venditore
Automata, languages and programming; Fifth Colloquium, Udine July 1978; Lecture notes in computer science ; 62
Editore:
Berlin ; Heidelberg [u.a.] : Springer, 1978
ISBN 10: 3540088601
ISBN 13: 9783540088608
Antico o usato
Broschiert
Da: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germania
Valutazione del venditore 5 su 5 stelle
Broschiert. Condizione: 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. Codice articolo 1805346
Quantità: 1 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings (Lecture Notes in Computer Science)
Da: NEPO UG, Rüsselsheim am Main, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 368674
Quantità: 2 disponibili
Foto dell'editore
Automata, Languages and Programming: Proceedings of Fifth Colloquium; Udine, Italy; July 17-21, 1978. Volume 62, Lecture Notes in Computer Science.
Editore:
Springer-Verlag, OHG, Berlin, Germany, 1978
ISBN 10: 3540088601
ISBN 13: 9783540088608
Antico o usato
Paperback
Prima edizione
Da: SUNSET BOOKS 2, Newark, OH, U.S.A.
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: 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. Codice articolo 009047
Quantità: 1 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 4880203
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming : Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings
Editore:
Springer Berlin Heidelberg, 1978
ISBN 10: 3540088601
ISBN 13: 9783540088608
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783540088608
Quantità: 1 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming
ISBN 10: 3540088601
ISBN 13: 9783540088608
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783540088608
Quantità: 1 disponibili
Foto dell'editore
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings (Lecture Notes in Computer Science, 62)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540088608_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming
Editore:
Springer Berlin Heidelberg Jul 1978, 1978
ISBN 10: 3540088601
ISBN 13: 9783540088608
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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, Französisch. Codice articolo 9783540088608
Quantità: 2 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings (Lecture Notes in Computer Science) (English and French Edition)
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. 0387088601 Ex-Library hardcover no dj (red boards) in very nice condition with all the usual markings and attachments. Codice articolo DA1412884
Quantità: 1 disponibili
Foto dell'editore
Automata, Languages and Programming : Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9783540088608
Quantità: 10 disponibili