The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged numberofstates
0
votes
0
answers
1
TOC : Minimum State in Finite Automata ( virtualgate )
asked
4 days
ago
in
Theory of Computation
by
arya_stark
(
365
points)

15
views
theoryofcomputation
finiteautomata
minimalstateautomata
numberofstates
0
votes
1
answer
2
Number of States in TOC
Number of $2$ state DFA with designated initial state can be constructed over alphabet $\sum_{.}^{.}=\left \{ 0,1 \right \}$ and that accept empty language $\Phi$ is_______________
asked
Oct 6
in
Theory of Computation
by
srestha
Veteran
(
98.3k
points)

74
views
theoryofcomputation
minimalstateautomata
numberofstates
0
votes
1
answer
3
Minimal DFA
Minimum states required for DFA that accepts : L = {w1 x w2  w,x belongs to {a,b}*  w1 >= 0, w2 > 1 and x >= 0 }.
asked
Sep 10
in
Theory of Computation
by
Na462
Loyal
(
6.4k
points)

35
views
theoryofcomputation
minimalstateautomata
numberofstates
+1
vote
0
answers
4
Minimum number of States
Ans. 5
asked
Aug 30
in
Theory of Computation
by
Na462
Loyal
(
6.4k
points)

61
views
minimalstateautomata
finiteautomata
theoryofcomputation
numberofstates
0
votes
1
answer
5
#Number of states in minimal DFA
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11. (a) 6 (b) 7 (c) 8 (d) 9
asked
Jul 31
in
Theory of Computation
by
himgta
Active
(
1.7k
points)

32
views
numberofstates
0
votes
1
answer
6
#Test series
What is the number of states in the minimal finite automata that accepts all the strings of a’s and b’s where each string starts with ‘bba’ and the length of the string is congruent to 2(mod 6). (a) 8 (b) 9 (c) 10 (d) 11
asked
Jul 30
in
Theory of Computation
by
himgta
Active
(
1.7k
points)

18
views
#
numberofstates
0
votes
1
answer
7
Minimum finite automata
Construct the Minimum FA that accepts all the string of 0's and 1's where A)Every String start and end with Zero. B)Every string Start and end with Same Symbol.
asked
Jul 10
in
Theory of Computation
by
suraj patel
(
59
points)

128
views
finiteautomata
theoryofcomputation
minimalstateautomata
numberofstates
0
votes
0
answers
8
Minimal dfa
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
asked
Jun 12
in
Theory of Computation
by
Harshitha 123
(
99
points)

72
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
0
votes
3
answers
9
No of states in Minimal DFA
Ques: Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8)? *[ Can anybody explain this as I am getting 8 states for this since remainders will be 8 (0,1,2,3,4,5,6,7). But the answer is 4].
asked
May 8
in
Theory of Computation
by
kislaya Pant
(
165
points)

153
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
+1
vote
1
answer
10
Minimal Final States in DFA
Ques: What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4).
asked
May 8
in
Theory of Computation
by
kislaya Pant
(
165
points)

92
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
+1
vote
1
answer
11
Number of States in FA
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
asked
Apr 8
in
Theory of Computation
by
smsubham
Loyal
(
7.9k
points)

140
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
+1
vote
0
answers
12
Worst Case in NFA to DFA Conversion
Can you give an example of NFA which has n states and its corresponding DFA has 2^n states?
asked
Apr 8
in
Theory of Computation
by
smsubham
Loyal
(
7.9k
points)

99
views
theoryofcomputation
nfa
finiteautomata
numberofstates
+1
vote
2
answers
13
NFAE to DFA conversion. (which is the correct solution?)
asked
Feb 27
in
Theory of Computation
by
ashishgateashish
(
93
points)

386
views
theoryofcomputation
nfa
finiteautomata
numberofstates
+3
votes
1
answer
14
Calculation of number of states in dfa without drwing dfa
asked
Jan 15
in
Theory of Computation
by
Sona Barman
Active
(
1.2k
points)

85
views
theoryofcomputation
finiteautomata
numberofstates
+2
votes
0
answers
15
minimal dfa
Consider the following grammar: $S\rightarrow aAbB$ $A\rightarrow aAbB$ $B\rightarrow bBϵ$ Then the number of states in a minimal D.F.A of the above grammar is ______________ ?
asked
Jan 15
in
Theory of Computation
by
junk_mayavi
Active
(
4k
points)

49
views
theoryofcomputation
minimalstateautomata
numberofstates
+2
votes
0
answers
16
Gate mock test
please explain answer given is 5
asked
Jan 4
in
Theory of Computation
by
VIKRAM KASANA
(
465
points)

122
views
theoryofcomputation
gate
mock
test
2018
finiteautomata
numberofstates
+2
votes
2
answers
17
#Strings DFA
$ L\ =\ \{\ a^mb^{2n}c^{3n}d^p\ \ m,n\ >=1\ ,\ p\ >\ m\} \\Find\ the\ number\ of\ strings\ of\ length\ <=\ 13$
asked
Dec 31, 2017
in
Theory of Computation
by
Tuhin Dutta
Loyal
(
8.2k
points)

115
views
theoryofcomputation
finiteautomata
numberofstates
+1
vote
1
answer
18
MINIMAL DFA
asked
Dec 31, 2017
in
Theory of Computation
by
Aakanchha
Junior
(
751
points)

139
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
0
votes
1
answer
19
minimal Dfa
asked
Dec 3, 2017
in
Theory of Computation
by
Parshu gate
Active
(
5k
points)

69
views
numberofstates
minimalstateautomata
theoryofcomputation
0
votes
2
answers
20
TOC: DFA
Consider the following NFA: How many final states required in the equivalent DFA?
asked
Nov 20, 2017
in
Theory of Computation
by
rahul sharma 5
Boss
(
25k
points)

138
views
theoryofcomputation
finiteautomata
numberofstates
+1
vote
1
answer
21
Minimum DFA Construction
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states. But I am getting many more states. Could someone please provide a diagram that involves only 12 states?
asked
Nov 17, 2017
in
Theory of Computation
by
humblefool
Junior
(
947
points)

147
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
+1
vote
0
answers
22
Number of states in DFA
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s. How many states does the above DFA have? How many final states? Please explain your answer.
asked
Nov 12, 2017
in
Theory of Computation
by
Warlock lord
Active
(
3.4k
points)

109
views
theoryofcomputation
finiteautomata
numberofstates
+2
votes
1
answer
23
TOC : Number of states in DFA
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
asked
Nov 9, 2017
in
Theory of Computation
by
rahul sharma 5
Boss
(
25k
points)

170
views
theoryofcomputation
finiteautomata
minimalstateautomata
numberofstates
0
votes
2
answers
24
NUMBER OF STATES IN DFA
asked
Nov 6, 2017
in
Theory of Computation
by
Parshu gate
Active
(
5k
points)

148
views
finiteautomata
theoryofcomputation
numberofstates
+1
vote
2
answers
25
Number of states in a minimal DFA construction
asked
Nov 2, 2017
in
Theory of Computation
by
humblefool
Junior
(
947
points)

203
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
0
votes
1
answer
26
Number of states in minimal DFA
Let L1 = $0^+1^+$ and L2 = $(01)^+$, $L3 = \frac{L1}{ L2^*}$. The number of state needed for minimal DFA are _____.
asked
Aug 31, 2017
in
Theory of Computation
by
cspsunny
(
19
points)

143
views
numberofstates
+2
votes
1
answer
27
#TOC DFA Question
The minimum possible number of states and number of final states of a DFA that accepts the regular language L = {w1aw2  w1,w2 ∈ {a,b}∗ , w1=2,w2<=3} is ______________ .
asked
Aug 24, 2017
in
Theory of Computation
by
iarnav
Loyal
(
8.6k
points)

293
views
finiteautomata
theoryofcomputation
regularexpressions
numberofstates
+2
votes
1
answer
28
Number of Final states in minimal FA(NFA)
asked
Aug 4, 2017
in
Theory of Computation
by
rahul sharma 5
Boss
(
25k
points)

182
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
+2
votes
1
answer
29
Important Question for number of states in DFA
asked
Jul 1, 2017
in
Theory of Computation
by
Shubhanshu
Boss
(
15.5k
points)

343
views
theoryofcomputation
finiteautomata
numberofstates
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
List of Available Exams
New Assignment on Network programming : P2P simulation
Theory of Computation  GO Classroom
Probability  GO Classroom
Daily Quiz
Follow @csegate
Gatecse
Recent questions tagged numberofstates
Recent Blog Comments
@sahil you can see my response sheet...
How many tests will be uploaded before gate 19?
@IITDELHIVISHAL Yes, it will work. Make your...
sir if watch& making notes from quality videos...
yes! those will be available on GO,no need to pay
40,840
questions
47,500
answers
145,757
comments
62,259
users