Skip to content
College Subject Practice · College Year 2

Automata Theory practice questions — College Subject Practice · College Year 2 Computer Science

Practise automata theory with topic-based questions. Preview a sample, then start a short session.

See the question style before signup · Get instant feedback · Continue with focused practice

Try a sample question

Check your answer to see the explanation where one has been published.

Try this question
The Chomsky hierarchy classifies grammars into how many types?

1 sample question · No signup needed

Something unclear? Report this question.

2
The intersection of a context-free language and a regular language is always:
3
For the regular expression a∗b∗a^*b^*, which of the following strings is NOT in the described language?
Start a sample session

50 published questions available for this topic.