Register

DFA

328 views

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Theory of compilerNext → · GO Classes CS/DA | A...
← Previous in category · Test SeriesNext in category → · Theory of compiler -...
Position:
Show:

Related questions

1 1 vote
1 1 answer
1.0k
1.0k views
Hritik1204 asked Jan 5, 2024
1,022 views
Find the number of final states in DFA that recognizes L, where L= {w1a w2:|w1|≥3,|w2|≤5}, ∑={a, b} and w1, w2 ∈ ∑ * ______
1 1 vote
1 1 answer
1.9k
1.9k views
sripo asked Oct 13, 2018
1,870 views
Grammar to DFA Construction
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.
0 0 votes
1 answers 1 answer
1.6k
1.6k views
kumar.dilip asked Jan 19, 2019
1,600 views
Self Doubt
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00or 11.
1 1 vote
1 answers 1 answer
2.3k
2.3k views
Nishant Arora asked Dec 15, 2016
2,306 views
test book
The minimum number of states required to contruct a DFA accepting languages L= { w | w has an even number of both 0's and 2 's , and an odd number of 1's } over the alph...