| 000 | 02547cam a2200385 i 4500 | ||
|---|---|---|---|
| 001 | 40118 | ||
| 003 | 0000000000 | ||
| 005 | 20240411192945.0 | ||
| 008 | 150619s2017 mau s 000 0 eng | ||
| 010 | _a2015023479 | ||
| 019 | _a928614958 | ||
| 020 | _a1284077241 (casebound) | ||
| 020 | _a9781284077247 (casebound) | ||
| 035 | _a(OCoLC)911518549 | ||
| 035 | _a(OCoLC)911518549 | ||
| 040 |
_aDLC _beng _erda _cDLC _dYDX _dOCLCF _dYDXCP _dBTCTA _dCDX |
||
| 042 | _apcc | ||
| 050 | 0 | 0 |
_aQA267.3 _b.L56 2017 |
| 082 | 0 | 0 |
_a005.13/1 _223 |
| 100 | 1 | _aLinz, Peter. | |
| 245 | 1 | 3 |
_aAn introduction to formal languages and automata / _cPeter Linz, PhD, University of California at Davis. |
| 250 | _aSixth edition. | ||
| 264 | 1 |
_aBurlington, MA : _bJones & Bartlett Learning, _c[2017]. |
|
| 300 | _a1 online resource xiii, 449 pages. | ||
| 336 |
_atext _2rdacontent |
||
| 337 |
_acomputer _2rdamedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | 0 | _aIntroduction to the theory of computation -- Finite automata -- Regular languages and regular grammars -- Properties of regular 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. | |
| 520 | _aThe Sixth Edition of An Introduction to Formal Languages and Automata provides an accessible, student-friendly presentation of all material essential to an introductory Theory of Computation course. Written to address the fundamentals of formal languages, automata, and computability, the text is designed to familiarize students with the foundations and principles of computer science and to strengthen the students' ability to carry out formal and rigorous mathematical arguments. The author, Peter Linz, continues to offer a straightforward, uncomplicated treatment of formal languages and automata and avoids excessive mathematical detail so that students may focus on and understand the underlying principles. | ||
| 650 | 0 | _aFormal languages. | |
| 650 | 0 | _aMachine theory. | |
| 856 | _uhttps://drive.google.com/file/d/1vdH3n29d14a-IzTsYzF4B7lYme0Q-LUU/view?usp=sharing | ||
| 999 |
_c11216 _d11216 |
||