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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Finite Automata
[closed]
0
votes
105
views
closed as a duplicate of:
GATE200350
finiteautomata
theoryofcomputation
minimalstateautomata
regularexpressions
asked
Oct 19, 2018
in
Theory of Computation
by
Sambhrant Maurya
closed
Oct 19, 2018
by
Shaik Masthan

105
views
comment
+1
https://gateoverflow.in/939/gate200350
0
total string will 8
+1
U can follow above link, answer is 7
Please
log in
or
register
to add a comment.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
+2
votes
1
answer
1
Nondeterministic Finite Machine
Let M be a Nondeterministic Finite Machine. Let G be the Regular Grammar obtained from M. Which is True? (a) G will always be unambiguous (b) G will always be ambiguous (c) G may be ambiguous (d) None of the above
asked
Sep 28, 2015
in
Theory of Computation
by
MojoJojo

334
views
finiteautomata
regularexpressions
minimalstateautomata
0
votes
1
answer
2
Finite Automata
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA? Please elaborate.
asked
Nov 15, 2018
in
Theory of Computation
by
Mizuki

146
views
finiteautomata
theoryofcomputation
minimalstateautomata
nfadfa
0
votes
0
answers
3
TOC : Minimum State in Finite Automata ( virtualgate )
For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x) is given by How many minimum states will be in a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either 4 or 5. Ans is 5 or 20?
asked
Oct 12, 2018
in
Theory of Computation
by
arya_stark

95
views
theoryofcomputation
finiteautomata
minimalstateautomata
numberofstates
0
votes
1
answer
4
Doubt in Finite Automata
Consider the following DFA D. The number of states in the minimization of D is __________.
asked
Sep 12, 2018
in
Theory of Computation
by
goluabhinan

109
views
finiteautomata
theoryofcomputation
minimalstateautomata
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
IISc CDS Interview Experience, 2020
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
Subjects
All categories
General Aptitude
2k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
I got interview on 10th August 2020. Please...
They were eligible
Please add this one in the list too! IISc CDS...
Very helpful. can't thank you enough! :) :)
@toxicdesire I don't remember the exact...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,513
answers
201,931
comments
95,357
users