000			01265nam a2200229Ia 4500
003			NULRC
005			20250520103028.0
008			250520s9999 xx 000 0 und d
020			_a9798690145385
040			_cNULRC
050			_aQA 267.3 .S47 2020
100			_aSermutlu, Emre _eauthor
245		0	_aAutomata, formal languages, and turing mahines / _cEmre Sermutlu
260			_a[United States] : _b[publisher not identified], _cc2020
300			_av, 340 pages ; _c23 cm.
365			_bUSD19
504			_aIncludes bibliographical references and index.
505			_aPreface -- 1. Finite Automata -- 2. Nondeterminism -- 3. Regular Languages -- 4. Regular Expressions -- 5. Pumping Lemma -- 6. Context-Free Grammars -- 7. Different Forms of grammars -- 8. Pushdown Automata -- 9. Non-context Free Languages -- 10. Turing Machines - I -- 11. Turing machines II -- 12. An Undecidable Language -- 13, P and NP -- 14. NP- Complete Problems.
520			_aTuring Machines serve as valuable tools for comprehending the theoretical foundations of computer science, providing a panoramic view of all conceivable algorithms. Although this approach is highly enlightening, its abstract nature can pose challenges.
650			_aMACHINE THEORY
942			_2lcc _cBK
999			_c21732 _d21732