Second Course Formal Languages by Jeffrey Shallit (17 results)

Hardback. Condition: Very Good. 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.…

Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Hardback. Condition: Very Good. 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.…

Condition: As New. Unread book in perfect condition.

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

Condition: New.

Condition: New.

Condition: New. In English.

Hardback. Condition: New. 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.…

Condition: New.

Condition: As New. Unread book in perfect condition.

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

Hardcover. Condition: Brand New. 1st edition. 240 pages. 9.25x6.25x0.75 inches. In Stock.

Hardback. Condition: New. 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.…

Condition: New. Print on Demand pp. xi + 240 Illus.

Hardcover. Condition: new. Hardcover. 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. This graduate textbook covers topics in the theory of computation not usually covered in a first course. It explains combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes, repetitions in words, state complexity, the interchange lemma, 2DPDAs, and more. 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. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This graduate textbook covers topics in the theory of computation not usually covered in a first course. It explains combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes, rep.…