Main Page > BS Computer Science > Automata Theory
 |
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
Automata Theory
|
Regular languages, regular grammars, finite-state automate, transducers and relationships among them. Context-tree languages and grammars. Language recognition, parsers. Properties of formal languages. Turing computability and undesirability. |
| Credit hours/ Marks:- 3 |
|
|
