000			01577nam a22002537a 4500
003			NULRC
005			20250213150955.0
008			250213b ph ||||| |||| 00| 0 eng d
020			_a9783031119644
040			_cNULRC
050			_aQA 267.3 .P48 2022
100			_aPettorossi, Alberto _eauthor
245			_aAutomata theory and formal languages : _bfundamental notions, theorems and techniques / _cAlberto Pettorossi
260			_aSwitzerland : _bSpringer, _cc2022
300			_avii, 280 leaves ; _c26 cm.
365			_bUSD55.00
490			_aUndergraduate Topics in Computer Science
504			_aIncludes bibliographical references and index.
505			_a1. Formal Grammars and Languages -- 2. Finite Automata and Regular Grammars -- 3. Pushdown Automata and Context-Free Grammars -- 4. Linear Bounded Automata and Context-Sensitive Grammars -- 5. Turing Machines and Type 0 Grammars -- 6. Decidability and Undecidability in Context-Free Languages -- 7. Supplementary Topics.
520			_aKnowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general.
650			_aMACHINE THEORY
650			_aFORMAL LANGUAGES
942			_2lcc _cBK _n0
999			_c1893 _d1893