Nivat m (21 Ergebnisse)

Zustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Broché. 316 pages. 19x24cm.

8°, Original-Leinen. Einband fleckig, die Vorsätze braunschattig, am flieg. Vorsatz ein Stempel samt Inventarnummer einer Firma. 3 Blätter auf einem Streifen entlang des Innenstegs verfärbt, da ein ledernes Lesezeichen eingelegt war und das Papier reagiert hat (Oxidation). Davon abgesehen sauber. Solides, brauchbares Exemplar. - In englischer Sprache. IS: 0720420741 ****An unsere Kunden in Deutschland: Versand nach Deutschland einmal in der Woche ab Freilassing mit der Deutschen Post.*** - Sprache: Englisch Gewicht in Gramm: 1100. …

Zustand: Used. pp. viii + 312 Illus.

Zustand: New. In English.

Casterman 1967, petit In-4 broché de 316 p. Bon état.

Zustand: New.

Zustand: New. pp. 252.

Broché. Zustand: Etat satisfaisant. in-8 carré Description :316 pp. Marges jaunies. Couverture insolée, légèrement salie. Langue : Français Nb de volumes : 1.

Zustand: New.

Zustand: Good. 572 pp., softcover, ex library, else text clean & binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Photos available upon request.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - An introduction to finite automata on infinite words.- Deterministic and non ambiguous rational -languages.- Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme.- Automates boustrophedon sur des mots infinis.- Star-free -languages and first order logic.- A formal proof system for infinitary rational expressions.- Logical formulas and four subclasses of -regular languages.- Deterministic asynchronous automata.- Alternating automata on infinite objects, determinacy and Rabin's theorem.- The solution of two star-height problems for regular trees.- Decidability of yield's equality for infinite regular trees.- Languages and subshifts.- The adherences of languages as topological spaces.- Mots infinis en arithmetique.- Kth power-free codes.- On various classes of infinite words obtained by iterated mappings.- Overlap free words on two symbols.- Overlap-free sequences.…

Hardcover. Zustand: Good. pp. 316 French.

Softcover. Zustand: Near fine. Lecture Notes in Computer Science 192. iv, 215 p. 24 cm. Browned paper. Texts of the conference held at Ecole de Printemps d'Informatique Théorique Le Mont Dore, May 1984.

Hardcover mit Umschlag Sehr gut erhalten.

Zustand: New. In English.

Zustand: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher | This review volume contains a selection of papers by leading experts in the areas of Parallel Image Analysis, 2-D, 3-D Grammars and Automata and Neural Nets and Learning.

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | This review volume contains a selection of papers by leading experts in the areas of Parallel Image Analysis, 2-D, 3-D Grammars and Automata and Neural Nets and Learning.

Gebunden. Zustand: New. The theory of tree languages, founded in the late Sixties and still active in the Seventies, was much less active during the Eighties. Now there is a simultaneous revival in several countries, with a number of significant results proved in the past five yea.

Buch. Zustand: Neu. Neuware - The theory of tree languages, founded in the late Sixties and still active in the Seventies, was much less active during the Eighties. Now there is a simultaneous revival in several countries, with a number of significant results proved in the past five years. A large proportion of them appear in the present volume.The editors of this volume suggested that the authors should write comprehensive half-survey papers. This collection is therefore useful for everyone interested in the theory of tree languages as it covers most of the recent questions which are not treated in the very few rather old standard books on the subject. Trees appear naturally in many chapters of computer science and each new property is likely to result in improvement of some computational solution of a real problem in handling logical formulae, data structures, programming languages on systems, algorithms etc. The point of view adopted here is to put emphasis on the properties themselves and their rigorous mathematical exposition rather than on the many possible applications.This volume is a useful source of concepts and methods which may be applied successfully in many situations: its philosophy is very close to the whole philosophy of the ESPRIT Basic Research Actions and to that of the European Association for Theoretical Computer Science.…

Recueils 1-2-3. 64+64+64 fiches 19,5x24cm. Sous couvertures rempliées. 256+260+256 pages.