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.
EUR 18,79 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiEUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiDa: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Regno Unito
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
Da: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germania
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
Da: Attic Books (ABAC, ILAB), London, ON, Canada
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
Da: moluna, Greven, Germania
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
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
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
Da: AHA-BUCH GmbH, Einbeck, Germania
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
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
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
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783540083429_new
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
PF. Condizione: New. Codice articolo 6666-IUK-9783540083429
Quantità: 10 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Mar3113020158046
Quantità: Più di 20 disponibili