Register

toc dfa states

491 views
0 votes
0 votes

User Avatar

1 Answer

Best answer
2 votes
2 votes

I think i cover every string:

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

33 votes
33 votes
3 answers
3
worst_engineer asked May 30, 2015
16,415 views
How many DFA's exist with three states over the input alphabet {0,1}
Is there any procedure to generalize these types of problems ? Thanks in advance
Is there any procedure to generalize these types of problems ? Thanks in advance
User Avatar
1 votes
1 votes
1 answer
4
sripo asked Oct 13, 2018
1,264 views
Grammar to DFA Construction
For the given Grammar S->aA|bB A->bC|aS B->aC|bS C->aB|bA Construct DFA I am getting confused in understanding how to take the final state.
For the given GrammarS->aA|bBA->bC|aSB->aC|bSC->aB|bA Construct DFA I am getting confused in understanding how to take the final state.
User Avatar
Link Copied!