Register

Construct Minimal DFA
closed

• closed by
552 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 1997 | Question: 20

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

Related questions

5 votes
5 votes
2 answers
1
pC asked Jan 2, 2016
2,720 views
How to construct compound Automata ? and find the no of states in minimal FA ?
Construct Minimal FA that accept all binary strings ends with 01 AND length of string is EVEN . Also find no of states in its minimal FA
Construct Minimal FA that accept all binary strings ends with 01 AND length of string is EVEN .Also find no of states in its minimal FA
User Avatar
0 votes
0 votes
0 answers
2
Hamsho asked Jun 11, 2022
354 views
construct a DFA of the language containing the set of all strings over {a, b} which accepts strings with length > 3 and the first digit from LHS is different from the third digit on the RHS
Ex. (baaab, babababa, aaabbaaabbb)Ex. (babab, abaaabb, aaaa, bbab)
User Avatar
0 votes
0 votes
0 answers
3
Subhrangsu asked May 28, 2022
613 views
Construct equivalent DFA transaction table for the following NFA.
Construct equivalent DFA transaction table for the following NFA.
Construct equivalent DFA transaction table for the following NFA.
User Avatar
4 votes
4 votes
3 answers
4
Vaishnavi8d asked Dec 10, 2018
19,821 views
construct of Deterministic Finite Automata (DFA) from following regular expression (0+1)*(00+11) (0+1)*
User Avatar
Link Copied!