College Subject Practice · College Year 2
Formal Languages practice questions — College Subject Practice · College Year 2 Computer Science
Practise formal languages 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
Which automaton recognizes exactly the class of regular languages?
1 sample question · No signup needed
2
A context-free grammar is one in which every production has the form where:
3
The pumping lemma for context-free languages states that any sufficiently long string in a CFL can be written as such that:
Start a sample session
50 published questions available for this topic.