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

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Prev
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 numberofdfa
+1
vote
3
answers
1
Ace Test Series: Theory Of Computation  Finite Automata
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$
asked
May 22
in
Theory of Computation
by
Hirak
Active
(
3.4k
points)

163
views
acetestseries
theoryofcomputation
finiteautomata
numberofdfa
+1
vote
1
answer
2
ACE ACADEMY: TOC
How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ? (a) 4 (b) 16 (c) 20 (d) 24
asked
May 22
in
Theory of Computation
by
Hirak
Active
(
3.4k
points)

69
views
theoryofcomputation
numberofdfa
#dfa
+2
votes
1
answer
3
Ace Academy Question Bank: Automata
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states. (a) $2^5$^0$ × $50^5$ (b) $2^1$^0$ × $10^5$^0$ (c) $2^5$ × $10^5$^0$ (d) $2^5$^0$ × $50^5$
asked
May 22
in
Theory of Computation
by
Hirak
Active
(
3.4k
points)

78
views
theoryofcomputation
numberofdfa
0
votes
1
answer
4
Self Doubt
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11.
asked
Jan 19
in
Theory of Computation
by
kumar.dilip
Active
(
5.1k
points)

58
views
#dfa
numberofdfa
minimalstateautomata
0
votes
1
answer
5
Number of DFA's (Made easy test series)
The number of DFA's with four states which can be constructed of the alphabet $\Sigma = \{ a,b \}$ with a designated initial state are $2^n$, then the value of n is _____. IN DFA IT IS COMPULSORY TO HAVE 1 FINAL STATE. 4c0 should not be taken,correct me?
asked
Nov 18, 2018
in
Theory of Computation
by
twin_123
(
297
points)

196
views
numberofdfa
+1
vote
1
answer
6
Grammar to DFA Construction
For the given Grammar S>aAbB A>bCaS B>aCbS C>aBbA Construct DFA I am getting confused in understanding how to take the final state.
asked
Oct 13, 2018
in
Theory of Computation
by
sripo
Active
(
2.3k
points)

79
views
theoryofcomputation
finiteautomata
regulargrammar
numberofdfa
minimalstateautomata
0
votes
1
answer
7
Madeeasy workbook
Why this language is regular ? And answer to this question ?
asked
Sep 30, 2018
in
Theory of Computation
by
Arjun045
(
19
points)

41
views
numberofdfa
regularlanguages
0
votes
1
answer
8
Theory of computation dfa construction
$\Large L = \left \{ a^{m^n}  n \geq 1, m > n \right \}$ What is the Minimum no.of states in a DFA which accept this language
asked
Sep 19, 2018
in
Theory of Computation
by
Mudita
(
23
points)

59
views
numberofdfa
0
votes
1
answer
9
#Number of DFAs
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states?
asked
Jul 24, 2018
in
Theory of Computation
by
himgta
Active
(
3.6k
points)

76
views
numberofdfa
0
votes
1
answer
10
toc dfa states
asked
Nov 5, 2017
in
Theory of Computation
by
Parshu gate
Active
(
3.1k
points)

78
views
theoryofcomputation
finiteautomata
numberofdfa
+2
votes
1
answer
11
SELF DOUBT
If we are having n states and m alphabets..how many DFAs and NFAs are possible?
asked
Aug 10, 2017
in
Theory of Computation
by
Vivek Jain
Junior
(
771
points)

88
views
theoryofcomputation
finiteautomata
numberofdfa
nfa
+1
vote
0
answers
12
Classroom notes
PLease help me , i have seen the same questions in many places but didnt understand the solution .
asked
Aug 4, 2017
in
Theory of Computation
by
Parshu gate
Active
(
3.1k
points)

146
views
theoryofcomputation
numberofdfa
+1
vote
2
answers
13
Count the Number of Dfa's
How many DFA's can be constructed with 3 states and 2 input symbols which accept empty language?
asked
Jul 11, 2017
in
Theory of Computation
by
Kaustubh _15
(
43
points)

213
views
theoryofcomputation
numberofdfa
finiteautomata
+3
votes
1
answer
14
#theory of computation #DFA #NFA
Consider regular expression r, where r = (11 + 111)* over Ʃ = {0, 1}. Number of states in minimal NFA and DFA respectively are: A NFA – 3, DFA – 4 B NFA – 3, DFA – 3 C NFA – 3, DFA – 3 D NFA – 4, DFA – 4
asked
Apr 17, 2017
in
Theory of Computation
by
Deepthi_ts
Active
(
3.4k
points)

445
views
theoryofcomputation
numberofdfa
nfa
+1
vote
3
answers
15
How many DFAs are possible?
How many 3 state DFA's can be constructed with a designated initial final state that accepts empty language over alphabet {a,b}?
asked
Apr 1, 2017
in
Theory of Computation
by
AnilGoudar
Active
(
4.3k
points)

444
views
theoryofcomputation
finiteautomata
numberofdfa
+1
vote
1
answer
16
test book
The minimum number of states required to contruct a DFA accepting languages L= { w  w has an even number of both 0's and 2 's , and an odd number of 1's } over the alphabet $\Sigma =\left \{ 0,1,2,3 \right \}$ is _____ please write regular expression also.
asked
Dec 15, 2016
in
Theory of Computation
by
Nishant Arora
Active
(
2.9k
points)

232
views
regularexpressions
minimalstateautomata
numberofdfa
testbooktestseries
theoryofcomputation
0
votes
1
answer
17
Number of states in DFA divisible by 8
Number of states for DFA which is divisble by 8 , I mostly try to identify by using number of distinct states. In this case , it would be 8 ; but minimized dfa would be less ? I read somewhere , the unique states sould be 4 and so ... but is this right ? And can someone explain , what is meant by unique states ? Do we have fixed formula for such problems ?
asked
Dec 7, 2016
in
Theory of Computation
by
vishal8492
Junior
(
595
points)

734
views
finiteautomata
numberofdfa
+1
vote
2
answers
18
Number of DFA ?
Let $q_0$ and $q_1$ be two states, with $q_0$ always being the initial state. Let the alphabet be $\{a, b\}$. Then, the possible number of DFA's with only these two states $q_0$ and $q_1$ is? 32 64 80 120
asked
Nov 22, 2015
in
Theory of Computation
by
prathams
Active
(
1.3k
points)

363
views
theoryofcomputation
numberofdfa
+29
votes
3
answers
19
How many DFA's exist with three states over the input alphabet {0,1}
Is there any procedure to generalize these types of problems ? Thanks in advance
asked
May 30, 2015
in
Theory of Computation
by
worst_engineer
Active
(
3.7k
points)

5.2k
views
theoryofcomputation
permutationandcombination
finiteautomata
numberofdfa
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
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
Follow @csegate
Recent questions tagged numberofdfa
Recent Blog Comments
Thanks a lot
Please tell me when will the books be back in...
Congrats you deserved it. Best of Luck.
Sorry, that was missed. You'll get it today.
49,839
questions
54,799
answers
189,488
comments
80,674
users