Automata, Languages and Programming - 6 Angebote vergleichen
Preise | 2012 | 2013 | 2014 | 2015 | 2019 |
---|---|---|---|---|---|
Schnitt | € 23,70 | € 24,62 | € 37,70 | € 52,78 | € 35,99 |
Nachfrage |
1
Automata, Languages and Programming (1977)
~EN PB NW
ISBN: 9783540083429 bzw. 3540083421, vermutlich in Englisch, Springer, Taschenbuch, neu.
Lieferung aus: Deutschland, Lieferbar in 5 - 7 Tagen.
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. Taschenbuch, 11.07.1977.
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. Taschenbuch, 11.07.1977.
2
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Lecture Notes in Computer Science) (1977)
DE PB US
ISBN: 9783540083429 bzw. 3540083421, in Deutsch, Springer, Taschenbuch, gebraucht.
Von Händler/Antiquariat, Crashing Rocks Books [55397785], Punta Gorda, FL, U.S.A.
3540083421 USED BOOK in good condition| No supplements| Normal wear to cover, edges, spine, corners, and pages | Writing / highlighting | Inventory stickers | Satisfaction guaranteed!
3540083421 USED BOOK in good condition| No supplements| Normal wear to cover, edges, spine, corners, and pages | Writing / highlighting | Inventory stickers | Satisfaction guaranteed!
3
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Paperback) (1977)
DE PB NW
ISBN: 9783540083429 bzw. 3540083421, in Deutsch, Springer, Berlin/Heidelberg, Deutschland, Taschenbuch, neu.
Von Händler/Antiquariat, ABC Books [9235530], Lowfield Heath, CRAWL, United Kingdom.
Paperback. Shipping may be from our UK, US or Australian warehouse depending on stock availability. This item is printed on demand. 572 pages. 0.807.
Paperback. Shipping may be from our UK, US or Australian warehouse depending on stock availability. This item is printed on demand. 572 pages. 0.807.
4
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Paperback) (1977)
DE PB NW
ISBN: 9783540083429 bzw. 3540083421, in Deutsch, Springer, Berlin/Heidelberg, Deutschland, Taschenbuch, neu.
Von Händler/Antiquariat, Citi Retail [9235530], Lowfield Heath, United Kingdom.
Paperback. Shipping may be from our UK, US or Australian warehouse depending on stock availability. This item is printed on demand. 572 pages. 0.807.
Paperback. Shipping may be from our UK, US or Australian warehouse depending on stock availability. This item is printed on demand. 572 pages. 0.807.
5
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (1977)
EN NW
ISBN: 9783540083429 bzw. 3540083421, in Englisch, Springer Berlin Heidelberg, Springer Berlin Heidelberg, Springer Berlin Heidelberg, neu.
Lieferung aus: Vereinigte Staaten von Amerika, zzgl. Versandkosten, Free Shipping on eligible orders over $25.
A. Salomaa (Editor), M. Steinby (Editor),Paperback - 1977, Edition: 1,Series: Lecture Notes in Computer Science Series 52, English-language edition,Pub by Springer Berlin Heidelberg.
A. Salomaa (Editor), M. Steinby (Editor),Paperback - 1977, Edition: 1,Series: Lecture Notes in Computer Science Series 52, English-language edition,Pub by Springer Berlin Heidelberg.
6
Automata, Languages and Programming
DE NW
ISBN: 9783540083429 bzw. 3540083421, in Deutsch, Springer, Berlin/Heidelberg, Deutschland, neu.
Lieferung aus: Deutschland, zzgl. Versandkosten, Sofort lieferbar.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…