Items related to Automata, Languages and Programming: Fourth Colloquium,...
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Lecture Notes in Computer Science, 52) - Softcover
Synopsis
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Lecture Notes in Computer Science) [paperback] Salomaa, A.,Steinby, M. [Jul 25, 1977]
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date1977
- ISBN 10 3540083421
- ISBN 13 9783540083429
- BindingPaperback
- LanguageEnglish
- Number of pages584
- EditorSalomaa A., Steinby M.
Search results for Automata, Languages and Programming: Fourth Colloquium,...
Seller Image
Automata, Languages and Programming, 1977
Seller: Attic Books (ABAC, ILAB), London, ON, Canada
Seller rating 5 out of 5 stars
Softcover. Condition: 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. Seller Inventory # 148871
Quantity: 1 available
Stock Image
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.
Seller: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 010287-2
Quantity: 1 available
Seller Image
Automata, languages and programming: colloquium University of Turku, July 18-22, 1977. Lecture notes in computer science ; 52
Published by
Berlin ; Heidelberg : Springer, 1977
ISBN 10: 3540083421
ISBN 13: 9783540083429
Used
Broschiert
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
Broschiert. Condition: 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. Seller Inventory # 1698736
Quantity: 1 available
Stock Image
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Lecture Notes in Computer Science, 52)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020158046
Quantity: Over 20 available
Stock Image
Automata, Languages and Programming : Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540083429
Quantity: 10 available
Stock Image
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Lecture Notes in Computer Science, 52)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540083429_new
Quantity: Over 20 available
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg Jul 1977, 1977
ISBN 10: 3540083421
ISBN 13: 9783540083429
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540083429
Quantity: 2 available
Seller Image
Automata, Languages and Programming : Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977
Published by
Springer Berlin Heidelberg, 1977
ISBN 10: 3540083421
ISBN 13: 9783540083429
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540083429
Quantity: 1 available
Seller Image
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, 1977
ISBN 10: 3540083421
ISBN 13: 9783540083429
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4879973
Quantity: Over 20 available