menu
search
Log In
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Finding minimum states in FA.

0 votes
300 views
If it is asked for minimum states required in FA for some language, we can have both NFA and DFA, and NFA has lesser number of states but many books write that consider DFA as default. What to take into consideration in such case?NFA or DFA?
in Theory of Computation 300 views
1
go with whatever result in minimum no of states.
0

@Praveen sir, I have also seen many questions in booklets and  here in gateoverflow where the best answer calculates minimum states using DFA (instead of using NFA)

1 Answer

0 votes
As per previous year solution of questions based on Minimal FA  they always considers DFA if nothing is specified.
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
1 answer
1
552 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 552 views
3 votes
1 answer
2
485 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 485 views
0 votes
1 answer
3
798 views
Min No of states in FA .
L =Set of all string which starts with a and ends with a .what will be the min no of states in FA represented by this Lang.
L =Set of all string which starts with a and ends with a .what will be the min no of states in FA represented by this Lang.
asked Jun 7, 2016 in Theory of Computation Amit Sharma 798 views
5 votes
3 answers
4
580 views
TOC: Number of states in minimum DFA
I think, there will be 4 states in minimum DFA, following states will be merged in the resulted DFA {q0&q3}, {q4&q5}, {q1&q6}, {q2&q7}
I think, there will be 4 states in minimum DFA, following states will be merged in the resulted DFA {q0&q3}, {q4&q5}, {q1&q6}, {q2&q7}
asked Oct 10, 2017 in Theory of Computation Manu Thakur 580 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...