Articles liés à Automata, Languages and Programming: Fourth Colloquium,...
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 - Couverture souple
- ÉditeurSpringer
- Date d'édition2008
- ISBN 10 3540083421
- ISBN 13 9783540083429
- ReliureBroché
- Langueanglais
- Nombre de pages584
- Coordonnées du fabricantnon disponible
Acheter D'occasion
état : SatisfaisantLight shelfwear to the cover extremities...
Afficher cet article
EUR 7,66
EUR 8,16 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisAcheter neuf
Afficher cet article
EUR 35,19
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Automata, Languages and Programming: Fourth Colloquium,...
Image d'archives
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.
Edité par
Springer, 1977
ISBN 10 : 3540083421
ISBN 13 : 9783540083429
Ancien ou d'occasion
Couverture souple
Vendeur : Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 010287-2
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, languages and programming: colloquium University of Turku, July 18-22, 1977. Lecture notes in computer science ; 52
Edité par
Berlin ; Heidelberg : Springer, 1977
ISBN 10 : 3540083421
ISBN 13 : 9783540083429
Ancien ou d'occasion
Broschiert
Vendeur : books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Broschiert. Etat : 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. N° de réf. du vendeur 1698736
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming, 1977
Edité par
Springer, Berlin, 1977
ISBN 10 : 3540083421
ISBN 13 : 9783540083429
Ancien ou d'occasion
Softcover
Vendeur : Attic Books (ABAC, ILAB), London, ON, Canada
Évaluation du vendeur 5 sur 5 étoiles
Softcover. Etat : 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. N° de réf. du vendeur 148871
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming
Edité par
Springer Berlin Heidelberg, 1977
ISBN 10 : 3540083421
ISBN 13 : 9783540083429
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 4879973
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Automata, Languages and Programming : Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977
Edité par
Springer Berlin Heidelberg, 1977
ISBN 10 : 3540083421
ISBN 13 : 9783540083429
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540083429
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming
Edité par
Springer Berlin Heidelberg Jul 1977, 1977
ISBN 10 : 3540083421
ISBN 13 : 9783540083429
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540083429
Quantité disponible : 2 disponible(s)
Image d'archives
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Lecture Notes in Computer Science, 52)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540083429_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Automata, Languages and Programming : Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540083429
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1977, 1977
ISBN 10 : 3540083421
ISBN 13 : 9783540083429
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540083429
Quantité disponible : 2 disponible(s)
Image d'archives
Automata, Languages and Programming: Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977 (Lecture Notes in Computer Science, 52)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020158046
Quantité disponible : Plus de 20 disponibles