menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
Yep, the problem was the theme π . I can see...
@Ayush I think problem is because of dark theme,...
then only someone from the officials can help...
Nope, it doesn't. I have tried everything.
hover mouse over "Taken " (or anywhere in that...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
TOC :- Number of states in DFA
2
votes
323
views
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}
theory-of-computation
finite-automata
minimal-state-automata
number-of-states
asked
Nov 9, 2017
in
Theory of Computation
rahul sharma 5
323
views
answer
comment
6
5 states DFA should be minimum,
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
4 should be the minimum number of states: (even, even) which is final and starting state denoting zero a and b. (even, odd) for even a and odd b. (odd, even) for odd a and even b. (odd,odd) for odd a and odd b.
Make appropriate transitions.
answered
Oct 12, 2018
Gupta731
comment
Please
log in
or
register
to add a comment.
β Prev.
Next β
β Prev. Qn. in Sub.
Next Qn. in Sub. β
Related questions
1
vote
2
answers
1
494
views
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) ?
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, 2017
in
Theory of Computation
humblefool
494
views
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
0
votes
3
answers
2
1.2k
views
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].
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, 2018
in
Theory of Computation
kislaya Pant
1.2k
views
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
1
vote
1
answer
3
548
views
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?
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
asked
Apr 8, 2018
in
Theory of Computation
smsubham
548
views
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
3
votes
1
answer
4
482
views
Number of Final states in minimal FA(NFA)
What will be total number of final states in NFA for the given regular expression? $R=(a+b)^{*}b(a+b+\epsilon )$
What will be total number of final states in NFA for the given regular expression? $R=(a+b)^{*}b(a+b+\epsilon )$
asked
Aug 4, 2017
in
Theory of Computation
rahul sharma 5
482
views
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
...