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
Exam Category
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.
Search results for finiteautomata
+8
votes
1
answer
1
How to construct an automata with even number of a's and odd number of b's?
asked
Mar 14, 2016
in
Theory of Computation
by
Gourab_Classic
(
61
points)

11.6k
views
minimalstateautomata
theoryofcomputation
finiteautomata
permutationsandcombinations
+8
votes
11
answers
2
GATE2017122
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet {a,b}. The smallest number of states needed in a deterministic finitestate automaton (DFA) accepting $L$ is ___________ .
asked
Feb 14
in
Theory of Computation
by
Arjun
Veteran
(
327k
points)

2.5k
views
gate20171
theoryofcomputation
finiteautomata
numericalanswers
+19
votes
6
answers
3
GATE200634
Consider the regular language $L=(111+11111)^{*}$ . The minimum number of states in any DFA accepting this languages is: 3 5 8 9
asked
Sep 22, 2014
in
Theory of Computation
by
Rucha Shelke
Loyal
(
4.3k
points)

3.3k
views
gate2006
theoryofcomputation
finiteautomata
normal
+1
vote
3
answers
4
TOC Sample practice
$L1 = \{a^m b^nc^{max(m,n)} : m,n > 1\}$ $L2 = \{a^{2^n}, n > 1\} \cup \{a^m, m>1\}$ (a) Both are regular (b) Only L2 is regular (c) Only L1 is regular (d) None of the above Solution: Option (b) how? here as l2 is not in ap it should not be regular right?
asked
6 days
ago
in
Theory of Computation
by
Pranav Madhani
Junior
(
597
points)

38
views
theoryofcomputation
finiteautomata
gate2018
question
isisamplepapers
+1
vote
1
answer
5
Need help to draw a DFA from a Right Linear grammar
.............................................................. .
asked
2 days
ago
in
Theory of Computation
by
Tuhin Dutta
Loyal
(
3.1k
points)

48
views
theoryofcomputation
finiteautomata
regulargrammar
0
votes
2
answers
6
TOC: DFA
Consider the following NFA: How many final states required in the equivalent DFA?
asked
4 days
ago
in
Theory of Computation
by
rahul sharma 5
Veteran
(
17.7k
points)

38
views
theoryofcomputation
finiteautomata
dfa
numberofstates
0
votes
1
answer
7
Regular and Non regular Language
if L1 = {anbn n>=0} is not regular then how come L2 = {ann>=0} is regular?
asked
1 day
ago
in
Theory of Computation
by
Mk Utkarsh
Junior
(
883
points)

33
views
theoryofcomputation
regularlanguages
finiteautomata
+1
vote
2
answers
8
Number of states in a minimal DFA construction
Suppose L is a regular language of all a's and b's where the number of a's is divisible by m and the number of b's is divisible by n. If M is the minimal DFA accepting language L, then what is the number of states in M ? Is it nm or (n+1)(m+1) ?
asked
Nov 2
in
Theory of Computation
by
humblefool
Junior
(
695
points)

77
views
theoryofcomputation
minimalstateautomata
finiteautomata
numberofstates
dfa
+2
votes
2
answers
9
complement of the Finite Automata
For below question assume you have input set = {a,b} Q1. Complement of the NFA accepting language L is equivalent to complement of the that language L. {True/False} Q2. What will be the complement of NFA accepting only epsilon?
asked
Nov 1
in
Theory of Computation
by
Shubhanshu
Veteran
(
11.3k
points)

80
views
theoryofcomputation
finiteautomata
dfa
0
votes
1
answer
10
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
in
Theory of Computation
by
humblefool
Junior
(
695
points)

30
views
theoryofcomputation
minimalstateautomata
dfa
finiteautomata
numberofstates
0
votes
1
answer
11
Gate Academy
Regular Expression of the NFA : A. 2*(0+12*)* B. 2*(0+2*)1* C. 2*(0+ 12*) D. 2*(01+12)*
asked
Nov 15
in
Theory of Computation
by
Saikat Dutta
(
77
points)

42
views
finiteautomata
0
votes
2
answers
12
NUMBER OF STATES IN DFA
asked
Nov 6
in
Theory of Computation
by
Parshu gate
Loyal
(
3.7k
points)

76
views
dfa
theoryofcomputation
finiteautomata
numberofstates
+7
votes
2
answers
13
Computation and Regular Expressions  Find a regular expression for the following scenarios
asked
Sep 22
in
Theory of Computation
by
Garrett McClure
Junior
(
585
points)

230
views
theoryofcomputation
regularexpressions
regularlanguages
finiteautomata
+1
vote
0
answers
14
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
in
Theory of Computation
by
rahul sharma 5
Veteran
(
17.7k
points)

60
views
theoryofcomputation
dfa
minimalstateautomata
finiteautomata
numberofstates
+2
votes
1
answer
15
DFA for Right Quotient of Regular Languages
For drawing the DFA for right quotient I have referred following link: Ref : https://www.seas.upenn.edu/~cit596/notes/dave/closure5.html But unable to get the dfa for the following language Its answer is c, and got that too using manual checking. but facing difficulty in drawing DFA for it.
asked
Nov 1
in
Theory of Computation
by
Shubhanshu
Veteran
(
11.3k
points)

49
views
theoryofcomputation
regularlanguages
finiteautomata
+1
vote
1
answer
16
TOC DFA
asked
Nov 5
in
Theory of Computation
by
Parshu gate
Loyal
(
3.7k
points)

51
views
dfa
finiteautomata
theoryofcomputation
+2
votes
1
answer
17
No of states in finite automata whose string length is divisible by 3 or 8 ?
asked
Sep 17
in
Theory of Computation
by
Vinil
(
299
points)

138
views
finiteautomata
theoryofcomputation
dfa
+9
votes
6
answers
18
GATE2017225
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$  $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left  w_{1} \right  = 2, \left  w_{2} \right \geq 3$} is ______________ .
asked
Feb 14
in
Theory of Computation
by
Madhav
Active
(
2k
points)

1.6k
views
theoryofcomputation
gate20172
finiteautomata
numericalanswers
+1
vote
2
answers
19
TOC BaSiCs
Please explain:
asked
Aug 15
in
Theory of Computation
by
learner_geek
Loyal
(
3.2k
points)

63
views
theoryofcomputation
regularexpressions
finiteautomata
0
votes
1
answer
20
Models of Computation  Find an NFA with two states that accepts the following language
asked
Sep 15
in
Theory of Computation
by
Garrett McClure
Junior
(
585
points)

85
views
theoryofcomputation
finiteautomata
nfa
algorithms
Page:
1
2
3
...
next »
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
Jobs @cvppindia
How to be productive?For all Members,GATE Aspirants, everybody associated with "GO Family"
How to Do preparation for Gate2018
How to write nice answers/questions in GO
Organizing NET Questions
Follow @csegate
Gatecse
Search results for finiteautomata
Recent Blog Comments
yes isro should change their dates. This is very ...
Hi Guys, I think this is not correct. ISRO ...
NIELIT specifically mailed that they decided ...
is there any chances of changing the exam date??
ISRO and NIELIT Exam on the same day i.e 17th ...
29,157
questions
36,984
answers
92,161
comments
34,824
users