| 000 -LEADER |
|---|
| fixed length control field |
04062nam a22003377a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20260702150047.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
260702s20242024sz a|||er|||| 001 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783031439728 [hardrbound] |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
University of Cebu-Banilad |
| Transcribing agency |
University of Cebu-Banilad |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Morazán, Marco T., |
| Relator term |
author. |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Programming-based formal languages and automata theory : |
| Remainder of title |
design, implement, validate, and prove / |
| Statement of responsibility, etc |
Marco T. Morazán. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Switzerland : |
| Name of publisher, distributor, etc |
Springer, |
| Date of publication, distribution, etc |
c2024. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xxiii, 524 pages : |
| Other physical details |
illustrations (black and white) ; |
| Dimensions |
24 cm. |
| 336 ## - CONTENT TYPE |
|---|
| Source |
rdacontent |
| Content type term |
text |
| 337 ## - MEDIA TYPE |
|---|
| Source |
rdamedia |
| Media type term |
unmedated |
| 338 ## - CARRIER TYPE |
|---|
| Source |
rdacarrier |
| Carrier type |
volume |
| 500 ## - GENERAL NOTE |
|---|
| General note |
https://doi.org/10.1007/978-3-031-439735 |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Contents: Preface — Part I Fundamental concepts — 1 Introduction to FSM — 2 Essential background — 3 Types of proofs — Part II Regular Languages — 4 Regular expressions — 5 Deterministic finite-state machines — 6 Nondeterministic finite-state machines — 7 Finite-state automatons and regular expressions — 8 Regular grammars — 9 Languages that are not regular — Part III Context-free languages — 10 Context-free languages — 11 Pushdown automata — 12 Equivalence of pdas and cfgs — 13 Properties of context-free languages — 14 Deterministic PDAs — Part IV Context-sensitive languages —15 Turing machines — 16 Turing machine composition — 17 Turing machine extension — 18 Context-sensitive grammars — 19 Church-turing thesis and undecidability — 20 Complexity — Part V Epilogue — 21 Where to Go from here. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
"This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students.<br/><br/>While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them.<br/><br/>Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs.<br/><br/>The book is divided into four parts that build on each other.<br/><br/>Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design.<br/><br/>In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets.<br/><br/>Part II starts the study of formal languages and automata theory in earnest with regular languages.<br/><br/>It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language.<br/><br/>Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language.<br/><br/>This leads to the study of deterministic and nondeterministic finite-state machines.<br/><br/>Part III starts the exploration of languages that are not regular with context-free languages.<br/><br/>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.<br/><br/>Part IV eventually explores languages that are not context-free, known as context-sensitive languages.<br/><br/>It starts by discussing the most powerful automaton known to mankind: the Turing machine.<br/><br/>It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored.<br/><br/>The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical." --Backcover |
| 521 ## - TARGET AUDIENCE NOTE |
|---|
| Target audience note |
Adult |
| 541 ## - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Source of acquisition |
Purchased |
| Deans/Chairperson |
Ortega, Eric |
| Department |
College of Computer Studies |
| Subject Category |
Computer Science |
| 546 ## - LANGUAGE NOTE |
|---|
| Language note |
Text in English |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Formal languages. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Machine theory. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Functional programming (Computer science). |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Compilers (Computer programs). |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Type of record |
Book |
| 998 ## - LOCAL CONTROL INFORMATION (RLIN) |
|---|
| Encoded by |
Janna [new] |
| Date encoded |
07/02/2026 |
