Register

Minimum DFA Construction

1,850 views
1 1 vote
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different.

It is given that the minimum DFA has 12 states. But I am getting many more states. Could someone please provide a diagram that involves only 12 states?

1 Answer

1 1 vote
Answer will be 16 it cant be in 12 states.
Voting & Accepting an answer helps improve the community
← Previous · Programming Previous...Next → · scheduling
← Previous in category · Peter Linz Edition 4...Next in category → · Regular and CFL
Position:
Show:

Related questions

2 2 votes
2 2 answers
2.5k
2.5k views
humblefool asked Nov 2, 2017
2,473 views
Number of states in a minimal DFA construction
Suppose L is a regular language of all a's and b's where the number of a's is divisible by m and the number of b's is divisible by n. If M is the minimal DFA accepting la...
0 0 votes
0 0 answers
810
810 views
arya_stark asked Oct 12, 2018
810 views
TOC : Minimum State in Finite Automata ( virtualgate )
For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x) is ...
1 1 vote
0 0 answers
1.8k
1.8k views
Na462 asked Aug 30, 2018
1,829 views
Minimum number of States
Ans. 5
0 0 votes
1 1 answer
4.2k
4.2k views
suraj patel asked Jul 10, 2018
4,213 views
Minimum finite automata
Construct the Minimum FA that accepts all the string of 0's and 1's whereA)Every String start and end with Zero.B)Every string Start and end with Same Symbol.