Articoli correlati a Theoretical Computer Science: 4th GI Conference Aachen,...
Contenuti
Context-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics?.- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical?.- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 – 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2008
- ISBN 10 3540091181
- ISBN 13 9783540091189
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine344
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 24,60
EUR 7,95 per la spedizione da Germania a Italia
Destinazione, tempi e costiRisultati della ricerca per Theoretical Computer Science: 4th GI Conference Aachen,...
Foto dell'editore
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.05. Codice articolo G3540091181I3N00
Quantità: 1 disponibili
Foto dell'editore
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979: 67 (Lecture Notes in Computer Science, 67) [Paperback] Weihrauch, K.
Da: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Some shelfwear; extremities are a little worn. Edges slightly upturned in places. Content of the book is mostly clean throughout, though ink inscription and some staining in places. A readable paperback. Codice articolo 001582-9
Quantità: 1 disponibili
Immagini fornite dal venditore
Theoretical Computer Science : 4th GI Conference Aachen, March 26-28, 1979
Editore:
Springer Berlin Heidelberg, 1979
ISBN 10: 3540091181
ISBN 13: 9783540091189
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 - InhaltsangabeContext-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics .- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical .- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 - 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme. Codice articolo 9783540091189
Quantità: 1 disponibili
Immagini fornite dal venditore
Theoretical Computer Science
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. Context-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics?.- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong. Codice articolo 4880344
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Theoretical Computer Science
Editore:
Springer Berlin Heidelberg Mrz 1979, 1979
ISBN 10: 3540091181
ISBN 13: 9783540091189
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 -InhaltsangabeContext-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics .- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical .- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 - 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme. 340 pp. Englisch, Französisch, Deutsch. Codice articolo 9783540091189
Quantità: 2 disponibili
Foto dell'editore
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 (Lecture Notes in Computer Science, 67)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540091189_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Theoretical Computer Science
ISBN 10: 3540091181
ISBN 13: 9783540091189
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Neuware -InhaltsangabeContext-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics .- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical .- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 - 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 340 pp. Englisch. Codice articolo 9783540091189
Quantità: 2 disponibili
Foto dell'editore
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 (Lecture Notes in Computer Science) (English, German and French Edition)
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Codice articolo UTD14a-0875
Quantità: 1 disponibili
Foto dell'editore
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 (Lecture Notes in Computer Science, 67) (English, German and French Edition)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: Very Good. Very Good. book. Codice articolo ERICA80035400911816
Quantità: 1 disponibili
Foto dell'editore
Theoretical Computer Science: 4th GI Conference Aachen, March 26-28, 1979 (Lecture Notes in Computer Science, 67)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020158397
Quantità: Più di 20 disponibili