Salomaa a (97 Ergebnisse)

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:9783540628446.

Hardcover. Zustand: Near Fine. No Jacket. 1st Edition. Semirings, Automata, Languages (Monographs on Theoretical Computer Science, Vol. 5 - An EATCS Series). Kuich, Werner; Salomaa, Arto. Published by Springer-Verlag, Berlin, 1986. 374p. hardcover no dust jacket, boards lightly bumped/scuffed, binding tight, text clean/unmarked, NOT xlib, near fine condition--ISBN 10: 3540137165ISBN 13: 9783540137160--27.00. …

Zustand: New.

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.

Hardcover. Zustand: Sehr gut. 1st ed. 894 S.; Ill. Very good. Shrink wrapped. Sprache: Englisch Gewicht in Gramm: 1650.

Zustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,600grams, ISBN.…

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:0521302455.…

Zustand: Good. Volume 23. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:3540528318.…

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.…

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: New.

Zustand: New. In English.

PF. Zustand: New.

Zustand: New.

Zustand: New. In English.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Theory of L systems: From the point of view of formal language theory.- A model for the growth and flowering of aster novae-angliae on the basis of table L-systems.- Adding continuous components to L-systems.- Formal language theoretical approach to intracellular behavior.- Three useful results concerning L languages without interactions.- On the size of dol languages.- Generatively deterministic L languages. Subword point of view.- Growth of strings in context dependent Lindenmayer systems.- Some growth functions of context-dependent L-systems.- Dol systems with rank.- Equivalence of L-systems.- The syntactic inference problem for dol-sequences.- Free groups in Lindenmayer systems.- Notes on pre-set pushdown automata.- Recurrence systems.- Adult languages of L systems and the Chomsky hierarchy.- Structured OL-systems.- Context in parallel rewriting.- Nonterminals and codings in defining variations of OL-systems.- Iteration grammars and lindenmayer AFL's.- Hyper-AFL's and ETOL systems.- -OL systems.- Bounded parallelism and regular languages.- Multidimensional Lindenmayer organisms.- Bibliography on L systems.…

Zustand: New.

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 acoroutine 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.…

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Zustand: Wie neu. 360 p. Like new. ISBN: 9789056991777 Sprache: Englisch Gewicht in Gramm: 927 17,1 x 1,9 x 25,4 cm, hardcover.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Hardcover. Zustand: Brand New. 1st edition. 285 pages. French language. 9.50x6.25x1.00 inches. In Stock.

Zustand: New.