Sakarovitch jacques (22 risultati)

Paperback. Condizione: new. Paperback. This book constitutes the refereed proceedings of the 8th International Workshop on the Finite-State-Methods and Natural Language Processing, FSMNLP 2009. The workshop was held at the University of Pretoria, South Africa on July 2009. In total 21 papers were submitted and of those papers 13 were accepted as regular papers and a further 6 as extended abstracts. The papers are devoted to computational morphology, natural language processing, finite-state methods, automata, and related formal language theory. Constitutes the refereed proceedings of the 8th International Workshop on the Finite-State-Methods and Natural Language Processing, FSMNLP 2009. The workshop was held at the University of Pretoria, South Africa on July 2009. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Paperback. Condizione: Brand New. 147 pages. 9.21x6.14x0.39 inches. In Stock.

Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condizione: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Hardcover. Condizione: Very Good. 9.75" x 7.5". xxiv, 758 pp. Originally published in French in 2003, English translation by Reuben Thomas. Last 3 pages creased at bottom corner, otherwise a bright clean copy. Boards have some light shelf wear, a few surface scratches, and a tiny bit of wear at board corners. This book weighs 1.8 kg, extra postage may be requested.…

paperback. Condizione: New. New .Ships From Multiple Locations. book.

Condizione: New.

Condizione: New. pp. xxiv + 758 Index.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. In English.

Condizione: New. pp. xxiv + 758 Illus.

Condizione: New.

Condizione: New. pp. xxiv + 758.

Condizione: As New. Unread book in perfect condition.

Condizione: New. A treatise on finite automata theory that both gives a rigorous account and illuminates its real meaning. Translator(s): Thomas, Reuben. Num Pages: 782 pages, 275 b/w illus. 520 exercises. BIC Classification: PBC; UYA. Category: (UU) Undergraduate. Dimension: 246 x 189 x 42. Weight in Grams: 163. . 2009. hardcover. . . . .…

Condizione: New. A treatise on finite automata theory that both gives a rigorous account and illuminates its real meaning. Translator(s): Thomas, Reuben. Num Pages: 782 pages, 275 b/w illus. 520 exercises. BIC Classification: PBC; UYA. Category: (UU) Undergraduate. Dimension: 246 x 189 x 42. Weight in Grams: 163. . 2009. hardcover. . . . . Books ship from the US and Ireland.…

Hardcover. Condizione: Brand New. 758 pages. 9.50x7.50x1.50 inches. In Stock.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The first part of the book is organised around notions of rationality and recognisability. The second part deals with relations between words realised by finite automata, which not only exemplifies the automata theory but also illustrates the variety of its methods and its fields of application. Many exercises are included, ranging from those that test the reader, to those that are technical results, to those that extend ideas presented in the text. Solutions or answers to many of these are included in the book.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book constitutes the refereed proceedings of the 8th International Workshop on the Finite-State-Methods and Natural Language Processing, FSMNLP 2009. The workshop was held at the University of Pretoria, South Africa on July 2009. In total 21 papers wer.…

Hardcover. Condizione: new. Hardcover. Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The first part of the book is organised around notions of rationality and recognisability. The second part deals with relations between words realised by finite automata, which not only exemplifies the automata theory but also illustrates the variety of its methods and its fields of application. Many exercises are included, ranging from those that test the reader, to those that are technical results, to those that extend ideas presented in the text. Solutions or answers to many of these are included in the book. A treatise on finite automata theory that both gives a rigorous account and illuminates its real meaning. The first part is organised around notions of rationality and recognisability. The second deals with relations between words realised by finite automata. Many exercises, often with solutions or answers, are included. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A treatise on finite automata theory that both gives a rigorous account and illuminates its real meaning. The first part is organised around notions of rationality and recognisability. The second deals with relations between words realised by finite automat.…