Zustand: 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. Bestandsnummer des Verk�ufers 010287-2

Verk�ufer kontaktieren

Gebraucht kaufen

EUR 7,74

W�hrung umrechnen

Versand: EUR 8,25

Von Vereinigtes K�nigreich nach Deutschland

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, languages and programming: colloquium University of Turku, July 18-22, 1977. Lecture notes in computer science ; 52

Salomaa, Arto and Magnus Steinby:

Verlag: Berlin ; Heidelberg : Springer, 1977

ISBN 10: 3540083421 ISBN 13: 9783540083429

Gebraucht Broschiert

Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Broschiert. Zustand: 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. Bestandsnummer des Verk�ufers 1698736

Verk�ufer kontaktieren

Gebraucht kaufen

EUR 28,95

W�hrung umrechnen

Versand: EUR 3,20

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming

Salomaa, A.|Steinby, M.

Verlag: Springer Berlin Heidelberg, 1977

ISBN 10: 3540083421 ISBN 13: 9783540083429

Neu Softcover

Print-on-Demand

Anbieter: moluna, Greven, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Zustand: 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. Bestandsnummer des Verk�ufers 4879973

Verk�ufer kontaktieren

Neu kaufen

EUR 35,19

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming

M. Steinby

Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1977, 1977

ISBN 10: 3540083421 ISBN 13: 9783540083429

Neu Taschenbuch

Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: 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. Bestandsnummer des Verk�ufers 9783540083429

Verk�ufer kontaktieren

Neu kaufen

EUR 37,44

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 2 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming : Fourth Colloquium, University of Turku, Finnland, July 18-22, 1977

M. Steinby

Verlag: Springer Berlin Heidelberg, 1977

ISBN 10: 3540083421 ISBN 13: 9783540083429

Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: 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. Bestandsnummer des Verk�ufers 9783540083429

Verk�ufer kontaktieren

Neu kaufen

EUR 37,44

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming

M. Steinby

Verlag: Springer Berlin Heidelberg Jul 1977, 1977

ISBN 10: 3540083421 ISBN 13: 9783540083429

Neu Taschenbuch

Print-on-Demand

Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: 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. Bestandsnummer des Verk�ufers 9783540083429

Verk�ufer kontaktieren

Neu kaufen

EUR 37,44

W�hrung umrechnen

Versand: EUR 3,00

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 2 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming, 1977

SALOMAA, Arto; STEINBY, Magnus (eds.)

Verlag: Springer, Berlin, 1977

ISBN 10: 3540083421 ISBN 13: 9783540083429

Gebraucht Softcover

Anbieter: Attic Books (ABAC, ILAB), London, ON, Kanada

Verk�uferbewertung 5 von 5 Sternen

Softcover. Zustand: 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. Bestandsnummer des Verk�ufers 148871

Verk�ufer kontaktieren