KERALA UNIVERSITY Class 4 formal languages and automata theory Question Paper 2020
Practice authentic previous year questions for better exam preparation.
Sample Questions
- Explain the different variants of Turing Machine in detail. ..... 20 OR
- Design a DFA that accepts strings of binary numbers divisible by 3
- Differentiate Mealy and Moore machine.
- What is NPDA? Give an example.
- Design a Turing machine to find 2's complement of a binary number.
Need a Custom Question Paper?
Practice More
Generate Similar formal languages and automata theory Question Paper →
Explore More Years
View All formal languages and automata theory Question Papers →