My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

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.

27Papers
18Years
72Questions
1Topics

Regular Languages and Finite Automata question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Regular Languages and Finite Automata. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 51 70.8%
Easy 15 20.8%
Hard 6 8.3%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 47 65.3%
Numerical Answer Type (NAT) 15 20.8%
MSQ 10 13.9%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
72 Qs

Most asked topics

Top topics across the included previous year papers.

Theory of Computation
72 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Regular Languages and Finite Automata
72 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) 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. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620262View paper
Computer Science and Information Technology (CS) 202620261View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20254View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20253View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20243View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20242View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20234View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20222View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20211View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20214View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20203View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20193View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20182View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20172View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20162View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20162View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20151View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20142View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20142View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20133View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20133View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20133View paper
Computer Science & Information Technology (CS) 201020102View paper
Computer Science & Information Technology (CS) 200920092View paper
Computer Science & Information Technology (CS) 200820085View paper
Computer Science & Information Technology (CS) 200720076View paper

All Regular Languages and Finite Automata previous year questions

Practice every matching question in batches of 20, with every available option.

1
2007 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2007

Let G be the non-planar graph with the minimum possible number of edges. Then G has

Open complete paper
2
2007 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2007

Which of the following is TRUE?

Open complete paper
3
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
Open complete paper
4
2007 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2007

Which of the following languages is regular?

Open complete paper
5
2007 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2007
The language accepted by this automaton is given by the regular expression

Question diagram

Open complete paper
6
2007 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2007

The minimum state automaton equivalent to the above FSA has the following number of states

Open complete paper
7
2008 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2008
Which of the following is true for the language \(\{ a^p \mid p \text{ is a prime} \}\)?
Open complete paper
8
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.
Open complete paper
9
2008 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2008
Given below are two finite state automata (→ indicates the start state and F indicates a final state).
Y:
ab
→ 112
2 (F)21

Z:
ab
→ 122
2 (F)11

Which of the following represents the product automaton Z × Y?
Open complete paper
10
2008 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2008
Match the following NFAs with the regular expressions they correspond to.

Question diagram

Open complete paper
11
2008 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2008
Which of the following are regular sets?
I. {aⁿb²ᵐ | n ≥ 0, m ≥ 0}
II. {aⁿbᵐ | n = 2m}
III. {aⁿbᵐ | n ≠ m}
IV. {xcy | x, y ∈ {a, b}*}
Open complete paper
12
2009 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2009
Which one of the following languages over the alphabet {0, 1} is described by the regular expression: \((0+1)^*0(0+1)^*0(0+1)^*\) ?
Open complete paper
13
2009 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2009
The above DFA accepts the set of all strings over {0, 1} that

Question diagram

Open complete paper
14
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\)?
Open complete paper
15
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\)?
Open complete paper
16
2013 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2013 [Session 1]
Consider the languages \(L_1 = \Phi\) and \(L_2 = \{a\}\). Which one of the following represents \(L_1 L_2^* \cup L_1^*\)?
Open complete paper
17
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.
Open complete paper
18
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?
Open complete paper
19
2013 · Computer Science & Information Technology · Theory of Computation · Regular Languages and Finite Automata
Computer Science & Information Technology (CS) 2013 [Session 3]
Consider the languages L₁=Φ and L₂={a}. Which one of the following represents L₁ L₂* ∪ L₁*?
Open complete paper
20
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.
Open complete paper

Showing 20 of 69 questions