Regular Languages and Finite Automata - Theory of Computation - Computer Science & Information Technology Previous Year Questions
Practice Regular Languages and Finite Automata - Theory of Computation - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
28Papers
19Years
75Questions
1Topics
Regular Languages and Finite Automata question pattern
Every graph below is calculated only from this selection.
Questions by year
Compare question counts across years.
Difficulty distribution
How the classified questions are distributed by difficulty.
75questions
Medium53
70.7%
Easy16
21.3%
Hard6
8%
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
75questions
MCQ50
66.7%
Numerical Answer Type (NAT)15
20%
MSQ10
13.3%
Subject weightage
Top subjects by unique question coverage.
Computer Science & Information Technology
75 Qs
Most asked topics
Top topics across the included previous year papers.
Theory of Computation
75 Qs
Subtopic coverage
Top subtopics inside this exact selection.
Regular Languages and Finite Automata
75 Qs
Paper coverage
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Computer Science and Information Technology (CS) 2026
2 Qs
Computer Science and Information Technology (CS) 2026
1 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
3 Qs
Computer Science & Information Technology (CS) 2011
3 Qs
Computer Science & Information Technology (CS) 2010
2 Qs
Computer Science & Information Technology (CS) 2009
2 Qs
Computer Science & Information Technology (CS) 2008
5 Qs
Computer Science & Information Technology (CS) 2007
6 Qs
Included previous year papers
Newest papers appear first. Search these papers or sort by year and name.
Paper name
Year
PDF
Attempt
Computer Science and Information Technology (CS) 20262026
2007 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2007
A minimum state deterministic finite automaton accepting the language L = {w | w ∈ {0,1}*, number of 0s and 1s in w are divisible by 3 and 5, respectively} has
2008 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2008
Let $fsa$ and $pda$ be two predicates such that $fsa(x)$ means $x$ is a finite state automaton, and $pda(y)$ means that $y$ is a pushdown automaton. Let $equivalent$ be another predicate such that $equivalent(a,b)$ means $a$ and $b$ are equivalent. Which of the following first order logic statements represents the following: Each finite state automaton has an equivalent pushdown automaton.
2010 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2010
Let \(L = \{ w \in (0 + 1)^* \mid w \text{ has even number of 1s} \}\). i.e. \(L\) is the set of all bit strings with even number of 1s. Which one of the regular expressions below represents \(L\)?
2010 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2010
Let \(w\) be any string of length \(n\) in \(\{0,1\}^*\). Let \(L\) be the set of all substrings of \(w\). What is the minimum number of states in a non-deterministic finite automaton that accepts \(L\)?
2013 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2013 [Session 1]
Consider the DFA A given below.
Which of the following are FALSE?
1. Complement of L(A) is context-free.
2. L(A) = L((11*0+0)(0+1)*0*1*)
3. For the language accepted by A, A is the minimal DFA.
4. A accepts all strings over {0, 1} of length at least 2.
2013 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2013 [Session 1]
The tester now tests the program on all input strings of length five consisting of characters ‘a’, ‘b’, ‘c’, ‘d’ and ‘e’ with duplicates allowed. If the tester carries out this testing with the four test cases given above, how many test cases will be able to capture the flaw?
2013 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2013 [Session 3]
Consider the DFA A given below.
Which of the following are FALSE? 1. Complement of L(A) is context-free. 2. L(A) = L((11*0+0)(0+1)*0*1*) 3. For the language accepted by A, A is the minimal DFA. 4. A accepts all strings over {0, 1} of length at least 2.
