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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Jeffrey Shallit is Professor of the David R. Cheriton School of Computer Science at the University of Waterloo. He is the author of Algorithmic Number Theory (co-authored with Eric Bach) and Automatic Sequences: Theory, Applications, Generalizations (co-authored with Jean-Paul Allouche). He has published approximately 90 articles on number theory, algebra, automata theory, complexity theory, and the history of mathematics and computing.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 5746369
Cantidad disponible: Más de 20 disponibles
Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
Condición: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Nº de ref. del artículo: 00101940383
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 5746369-n
Cantidad disponible: Más de 20 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Hardback. Condición: 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. Nº de ref. del artículo: LU-9780521865722
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9780521865722_new
Cantidad disponible: Más de 20 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9780521865722
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 5746369-n
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 1st edition. 240 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __0521865727
Cantidad disponible: 1 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: 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. . . . . Nº de ref. del artículo: V9780521865722
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: 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 multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9780521865722
Cantidad disponible: 1 disponibles