Register

DFA construction

• recategorized by
89 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Unnati Singh asked May 7
81 views
DFA construction
Design a DFA to recognize all strings over {a,b} such that L={awa : w ϵ {a,b}* }.
Design a DFA to recognize all strings over {a,b} such that L={awa : w ϵ {a,b}* }.
User Avatar
0 votes
0 votes
2 answers
2
Unnati Singh asked May 7
85 views
DFA construction
Construct a DFA with minimum number of states, accepting all strings over {a, b} such that the number of a’s is divisible by three and the number of b’s is divisible by two.
Construct a DFA with minimum number of states, accepting all strings over {a, b} such that the number of a’s is divisible by three and the number of b’s is divisible ...
User Avatar
1 votes
1 votes
1 answer
4
sripo asked Oct 13, 2018
1,291 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!