Articoli correlati a Automata, Languages and Programming: Fourth Colloquium,...
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977: 52 - Brossura
Contenuti
How hard is compiler code generation?.- "Natural" complexity measures and time versus memory: Some definitional proposals.- Semantics and proof theory of pascal procedures.- On the structure of combinatorial problems and structure preserving reductions.- Factor graphs, failure functions and Bi-Trees.- Parallel decomposition of LR(k) parsers.- Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata.- Termination tests inside ?-calculus.- On the computational power of reversal-bounded machines.- The contextsensitivity bounds of contextsensitive grammars and languages.- Serial composition of 2-way finite-state transducers and simple programs on strings.- The sequence equivalence problem for dol systems is decidable.- Languages defined by higher type program schemes.- Parsing and syntactic error recovery for context-free grammars by means of coarse structures.- On three types of unambiguity of context-free language.- The mathematics of record handling.- Macro grammars, lindenmayer systems and other copying devices.- On the time and tape complexity of hyper(1)-AFL's.- Renaming and erasing in szilard languages.- Some matching problems.- Complexite des demi — Groupes de matrices.- On the proper treatment or referencing, dereferencing and assignment.- Complexity of some problems concerning L systems.- Left-fitting translations.- Dynamic binary search.- About the derivation languages of grammars and machines.- Simple chain grammars.- Time-space trade-offs in a pebble game.- Non-deterministic polynomial optimization problems and their approximation.- Simple programs and their decision problems.- Theory of data structures by relational and graph grammars.- On backtracking and greatest fixpoints.- L systems of finite index.- The safety of a coroutine system.- Linear time simulation of multihead turing machines with head — To-head jumps.- Data types as objects.- On the difference between one and many.- On defining error recovery in context-free parsing.- LL(k) languages are closed under union with finite languages.- The time and tape complexity of developmental languages.- Rational relations of binary trees.- Structural equivalence of context-free grammar forms is decidable.- On the definition of classes of interpretations.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2008
- ISBN 10 3540083421
- ISBN 13 9783540083429
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine584
- Contatto del produttorenon disponibile
Compra usato
Condizioni: buonoLight shelfwear to the cover extremities...
Visualizza questo articolo
EUR 7,66
EUR 18,79 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiCompra nuovo
Visualizza questo articolo
EUR 35,19
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Automata, Languages and Programming: Fourth Colloquium,...
Foto dell'editore
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977: 52 (Lecture Notes in Computer Science, 52) [Paperback] Salomaa, A. and Steinby, M.
Da: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Light shelfwear to the cover extremities. Stain to the front cover. Inscriptions to the front of the content, which seems fine to read throughout despite signs of foxing. Codice articolo 010287-2
Quantità: 1 disponibili
Immagini fornite dal venditore
Automata, languages and programming: colloquium University of Turku, July 18-22, 1977. Lecture notes in computer science ; 52
Editore:
Berlin ; Heidelberg : Springer, 1977
ISBN 10: 3540083421
ISBN 13: 9783540083429
Antico o usato
Broschiert
Da: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germania
Valutazione del venditore 5 su 5 stelle
Broschiert. Condizione: Gut. X, 569 Seiten : graph. Darst. 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: 900. Codice articolo 1698736
Quantità: 1 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming, 1977
Da: Attic Books (ABAC, ILAB), London, ON, Canada
Valutazione del venditore 5 su 5 stelle
Softcover. Condizione: ex library-good. Lecture Notes in Computer Science 52. x, 569 p. 24 cm. B&w figures. Paperback. Ex library with labels on spine, rear endpaper, inside rear cover. Ink stamps on top edge and title. Small scuff on rear. Fourth Colloquium, U. of Turku, July 1977. Codice articolo 148871
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. How hard is compiler code generation?.- Natural complexity measures and time versus memory: Some definitional proposals.- Semantics and proof theory of pascal procedures.- On the structure of combinatorial problems and structure preserving reductions.- Fa. Codice articolo 4879973
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming
Editore:
Springer Berlin Heidelberg Jul 1977, 1977
ISBN 10: 3540083421
ISBN 13: 9783540083429
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 -How hard is compiler code generation .- Natural complexity measures and time versus memory: Some definitional proposals.- Semantics and proof theory of pascal procedures.- On the structure of combinatorial problems and structure preserving reductions.- Factor graphs, failure functions and Bi-Trees.- Parallel decomposition of LR(k) parsers.- Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata.- Termination tests inside -calculus.- On the computational power of reversal-bounded machines.- The contextsensitivity bounds of contextsensitive grammars and languages.- Serial composition of 2-way finite-state transducers and simple programs on strings.- The sequence equivalence problem for dol systems is decidable.- Languages defined by higher type program schemes.- Parsing and syntactic error recovery for context-free grammars by means of coarse structures.- On three types of unambiguity of context-free language.- The mathematics of record handling.- Macro grammars, lindenmayer systems and other copying devices.- On the time and tape complexity of hyper(1)-AFL's.- Renaming and erasing in szilard languages.- Some matching problems.- Complexite des demi ¿ Groupes de matrices.- On the proper treatment or referencing, dereferencing and assignment.- Complexity of some problems concerning L systems.- Left-fitting translations.- Dynamic binary search.- About the derivation languages of grammars and machines.- Simple chain grammars.- Time-space trade-offs in a pebble game.- Non-deterministic polynomial optimization problems and their approximation.- Simple programs and their decision problems.- Theory of data structures by relational and graph grammars.- On backtracking and greatest fixpoints.- L systems of finite index.- The safety of a coroutine system.- Linear time simulation of multihead turing machines with head ¿ To-head jumps.- Data types as objects.- On the difference between one and many.- On defining error recovery in context-free parsing.- LL(k) languages are closed under union with finite languages.- The time and tape complexity of developmental languages.- Rational relations of binary trees.- Structural equivalence of context-free grammar forms is decidable.- On the definition of classes of interpretations. 584 pp. Englisch. Codice articolo 9783540083429
Quantità: 2 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming : Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977
Editore:
Springer Berlin Heidelberg, 1977
ISBN 10: 3540083421
ISBN 13: 9783540083429
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 - How hard is compiler code generation .- Natural complexity measures and time versus memory: Some definitional proposals.- Semantics and proof theory of pascal procedures.- On the structure of combinatorial problems and structure preserving reductions.- Factor graphs, failure functions and Bi-Trees.- Parallel decomposition of LR(k) parsers.- Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata.- Termination tests inside -calculus.- On the computational power of reversal-bounded machines.- The contextsensitivity bounds of contextsensitive grammars and languages.- Serial composition of 2-way finite-state transducers and simple programs on strings.- The sequence equivalence problem for dol systems is decidable.- Languages defined by higher type program schemes.- Parsing and syntactic error recovery for context-free grammars by means of coarse structures.- On three types of unambiguity of context-free language.- The mathematics of record handling.- Macro grammars, lindenmayer systems and other copying devices.- On the time and tape complexity of hyper(1)-AFL's.- Renaming and erasing in szilard languages.- Some matching problems.- Complexite des demi ¿ Groupes de matrices.- On the proper treatment or referencing, dereferencing and assignment.- Complexity of some problems concerning L systems.- Left-fitting translations.- Dynamic binary search.- About the derivation languages of grammars and machines.- Simple chain grammars.- Time-space trade-offs in a pebble game.- Non-deterministic polynomial optimization problems and their approximation.- Simple programs and their decision problems.- Theory of data structures by relational and graph grammars.- On backtracking and greatest fixpoints.- L systems of finite index.- The safety of a coroutine system.- Linear time simulation of multihead turing machines with head ¿ To-head jumps.- Data types as objects.- On the difference between one and many.- On defining error recovery in context-free parsing.- LL(k) languages are closed under union with finite languages.- The time and tape complexity of developmental languages.- Rational relations of binary trees.- Structural equivalence of context-free grammar forms is decidable.- On the definition of classes of interpretations. Codice articolo 9783540083429
Quantità: 1 disponibili
Immagini fornite dal venditore
Automata, Languages and Programming
ISBN 10: 3540083421
ISBN 13: 9783540083429
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Neuware -How hard is compiler code generation .- Natural complexity measures and time versus memory: Some definitional proposals.- Semantics and proof theory of pascal procedures.- On the structure of combinatorial problems and structure preserving reductions.- Factor graphs, failure functions and Bi-Trees.- Parallel decomposition of LR(k) parsers.- Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata.- Termination tests inside -calculus.- On the computational power of reversal-bounded machines.- The contextsensitivity bounds of contextsensitive grammars and languages.- Serial composition of 2-way finite-state transducers and simple programs on strings.- The sequence equivalence problem for dol systems is decidable.- Languages defined by higher type program schemes.- Parsing and syntactic error recovery for context-free grammars by means of coarse structures.- On three types of unambiguity of context-free language.- The mathematics of record handling.- Macro grammars, lindenmayer systems and other copying devices.- On the time and tape complexity of hyper(1)-AFL's.- Renaming and erasing in szilard languages.- Some matching problems.- Complexite des demi ¿ Groupes de matrices.- On the proper treatment or referencing, dereferencing and assignment.- Complexity of some problems concerning L systems.- Left-fitting translations.- Dynamic binary search.- About the derivation languages of grammars and machines.- Simple chain grammars.- Time-space trade-offs in a pebble game.- Non-deterministic polynomial optimization problems and their approximation.- Simple programs and their decision problems.- Theory of data structures by relational and graph grammars.- On backtracking and greatest fixpoints.- L systems of finite index.- The safety of a coroutine system.- Linear time simulation of multihead turing machines with head ¿ To-head jumps.- Data types as objects.- On the difference between one and many.- On defining error recovery in context-free parsing.- LL(k) languages are closed under union with finite languages.- The time and tape complexity of developmental languages.- Rational relations of binary trees.- Structural equivalence of context-free grammar forms is decidable.- On the definition of classes of interpretations.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 584 pp. Englisch. Codice articolo 9783540083429
Quantità: 2 disponibili
Foto dell'editore
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Lecture Notes in Computer Science, 52)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540083429_new
Quantità: Più di 20 disponibili
Foto dell'editore
Automata, Languages and Programming : Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9783540083429
Quantità: 10 disponibili
Foto dell'editore
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Lecture Notes in Computer Science, 52)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020158046
Quantità: Più di 20 disponibili