Amazon cover image
Image from Amazon.com
Image from Coce

An introduction to formal languages and automata /

By: Contributor(s): Material type: TextTextPublisher: Burlington, Massachusetts : Jones & Bartlett Learning, World Headquarters, [2023]Copyright date: ©2023Edition: Seventh editionDescription: xiii, 584 pages : illustrations ; 23 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 9781284231601
Subject(s): DDC classification:
  • 005.131 LII 23
Contents:
Summary: This book is designed for an introductory course on formal languages, automata, computability, and related matters. These topics form a major part of what is known as the theory of computation. A course on this subject matter is now standard in the computer science curriculum and is often taught fairly early in the program. Hence, the prospective audience for this book consists primarily of sophomores and juniors majoring in computer science or computer engineering. Provided by publisher.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Book Non-borrowing Book Non-borrowing Library D Information Technology 005.131 LII (Browse shelf(Opens below)) Not For Loan 1004227
Book Book Library D Information Technology 005.131 LII (Browse shelf(Opens below)) Available 1004228
Book Book Library D Information Technology 005.131 LII (Browse shelf(Opens below)) Available 1004229
Total holds: 0

Includes bibliographical references and index.

Part I: Theory -- Introduction to the theory of computation -- Finite automata -- Regular languages and regular grammars -- Properties of regular languages -- Context-free languages -- Simplification of context-free grammars and normal forms -- Pushdown automata -- Properties of context-free languages -- Turing machines -- Other models of turing machines -- A hierarchy of formal languages and automata -- Limits of algorithmic computation -- Other models of computation -- An overview of computational complexity -- Part II: Applications -- Compilers and parsing -- LL parsing -- LR parsing -- Appendix A: Finite-State Transducers -- Appendix B: JFLAP: Useful Tools -- Answers: Solutions and Hints for Selected Exercises -- References for Further Reading -- Index.

This book is designed for an introductory course on formal languages, automata, computability, and related matters. These topics form a major part of what is known as the theory of computation. A course on this subject matter is now standard in the computer science curriculum and is often taught fairly early in the program. Hence, the prospective audience for this book consists primarily of sophomores and juniors majoring in computer science or computer engineering.
Provided by publisher.

There are no comments on this title.

to post a comment.