Register

Basic doubt in DFA

584 views
1 1 vote
1.Given a NFA and find the min. number of states in equivalent DFA ?

2.Given a NFA and find number of states in equivalent minimal DFA?

Now assume i am able to recognize the language from the given machine and i can construct the minimal DFA without subset construction algorithm.Assume I got answer as 5,and if i apply the subset construction algorithm i get 7 as answer.So what will be my final answer for 1 and 2?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Classroom notesNext → · TOC Language
← Previous in category · Classroom notesNext in category → · TOC Language
Position:
Show:

Related questions

2 2 votes
2 2 answers
3.9k
3.9k views
rahul sharma 5 asked Nov 21, 2017
3,916 views
[TOC] Basic doubt in DPDA
Following is the PDA that accept equal number of a and b.How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choic...
2 2 votes
0 0 answers
1.2k
1.2k views
Xylene asked Nov 25, 2016
1,211 views
Basic Doubt in Rice Theorem
I read this blog http://gatecse.in/rices-theorem/ and I have a doubt in the first property.An example in this blog is L(M) = {0} and it's written that TMno =sigma* . My d...
1 1 vote
1 1 answer
399
399 views
rahul sharma 5 asked Aug 2, 2017
399 views
Basic Dount in PDA functioning
Assume my language is WW^R (Palidromes)Now when we use PDA for this,we will guess middle everytime.It can be middle or it cant be middle,so a new branch is created everyt...
0 0 votes
1 answers 1 answer
656
656 views
rahul sharma 5 asked Nov 4, 2017
656 views
Basic doubt in CO
1. Effective address(Address of instruction or operand ) is virtual address or physical address?2. While solving problems is OS we say CPU generates virtual address and w...