Library Banner

Programming-based formal languages and automata theory : (Record no. 140345)

MARC details
000 -LEADER
fixed length control field 02624nam a22002297a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260406113407.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 260406b |||||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783031439728
040 ## - CATALOGING SOURCE
Transcribing agency PK-LaUMT
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.131
Item number MOR-P
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Morazan, Marco T.
245 10 - TITLE STATEMENT
Title Programming-based formal languages and automata theory :
Remainder of title design, implement, validate, and prove /
Statement of responsibility, etc Marco T. Morazan
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Cham :
Name of publisher, distributor, etc Springer,
Date of publication, distribution, etc 2024
300 ## - PHYSICAL DESCRIPTION
Extent xxiii, 524 p.
500 ## - GENERAL NOTE
General note Texts in computer science
520 ## - SUMMARY, ETC.
Summary, etc 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
546 ## - LANGUAGE NOTE
Language note Eng
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Formal language
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Automata theory
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Programming language
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
Holdings
Withdrawn status Lost status Damaged status Home library Current library Date acquired Full call number Barcode Date last seen Price effective from Koha item type Copy number
      UMT Main Campus UMT Main Campus 2026-04-06 005.131 MOR-P 152251 2026-04-06 2026-04-06 Books  
      UMT Main Campus UMT Main Campus 2026-06-03 005.131 MOR-P 152889 2026-06-03 2026-06-03 Books C.2