Sprache: Englisch
Verlag: Cambridge University Press, 2008
ISBN 10: 0521865727 ISBN 13: 9780521865722
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Sprache: Englisch
Verlag: Cambridge University Press, 2008
ISBN 10: 0521865727 ISBN 13: 9780521865722
Anbieter: World of Books (was SecondSale), Montgomery, IL, USA
Zustand: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.
Sprache: Englisch
Verlag: Cambridge University Press, 2008
ISBN 10: 0521865727 ISBN 13: 9780521865722
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 79,00
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2008
ISBN 10: 0521865727 ISBN 13: 9780521865722
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 114,39
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. A textbook for a graduate course on formal languages and automata theory, building on prior knowledge of theoretical computer models. Num Pages: 254 pages, 12 tables 241 exercises. BIC Classification: UYA. Category: (U) Tertiary Education (US: College). Dimension: 237 x 160 x 13. Weight in Grams: 476. . 2008. 1st Edition. hardcover. . . . . Books ship from the US and Ireland.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 125,78
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 1st edition. 240 pages. 9.25x6.25x0.75 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2008
ISBN 10: 0521865727 ISBN 13: 9780521865722
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Written for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes. Many topics often absent from other textbooks, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs, and the incompressibility method, are covered here. The author places particular emphasis on the resources needed to represent certain languages. The book also includes a diverse collection of more than 200 exercises, suggestions for term projects, and research problems that remain open.