This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in ...
Read More
This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical.
Read Less
Add this copy of Programming-Based Formal Languages and Automata Theory: to cart. $47.53, like new condition, Sold by Zubal Books rated 4.0 out of 5 stars, ships from Cleveland, OH, UNITED STATES, published 2023 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
*Price HAS BEEN REDUCED by 10% until Monday, Dec. 2 (SALE ITEM)* 547 pp., hardcover, publisher's statement printed to the fore edge margin of the front cover, else LIKE NEW. -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.
Add this copy of Programming-Based Formal Languages and Automata Theory: to cart. $61.04, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2023 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Cloth over boards. 524 p. Contains: Unspecified, Illustrations, black & white, Illustrations, color. Texts in Computer Science. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Programming-Based Formal Languages and Automata Theory: to cart. $61.05, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2023 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Sewn binding. Cloth over boards. 524 p. Contains: Unspecified, Illustrations, black & white, Illustrations, color. Texts in Computer Science.
Add this copy of Programming-Based Formal Languages and Automata Theory: to cart. $70.95, new condition, Sold by booksXpress, ships from Bayonne, NJ, UNITED STATES, published 2023 by Springer.
Add this copy of Programming-Based Formal Languages and Automata Theory: to cart. $73.13, new condition, Sold by Media Smart rated 4.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 2023 by Springer.
