https://wiki.devclub.in/index.php?action=history&feed=atom&title=COL352 2026-04-09T07:48:35Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=COL352&diff=564&oldid=prev 2026-03-04T09:59:49Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = COL352<br /> | name = Introduction to Automata &amp; Theory of<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = COL202<br /> | overlaps = <br /> }}<br /> <br /> == COL352 : Introduction to Automata &amp; Theory of ==<br /> Regular Languages, Finite Automata, equivalence, minimization, Myhill-Nerode Theorem, introduction to non-determinism, Context free grammars, Pushdown automata, equivalence and applications. Turing machines, Recursive and Recursively enumerable sets, non-determinism, RAMs and equivalence, Universal Turing Machines, undecidability, Rice&#039;s theorems for RE sets, Post machines, Basics of Recursive function theory. Equivalence, Church&#039;s thesis, computational complexity, space and time complexity of Turing Machines, Relationships, Savage&#039;s theorem, Complexity classes, Complete problems, NP-completeness, Cook-Levin theorem.</div>

Prashantt492