Register

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

354 views
0 votes
0 votes
Ex. (baaab, babababa, aaabbaaabbb)

Ex. (babab, abaaabb, aaaa, bbab)
User Avatar

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

1 votes
1 votes
0 answers
1
paressep28 asked Apr 25
89 views
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved?
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved? Answer Follow·1 Request ...
User Avatar
0 votes
0 votes
0 answers
3
koushriek asked May 19, 2022
1,389 views
Number of states in a DFA that accepts the language over the alphabet{0,1} where words start and end with a '1', have even length and where any 0 in the word is immediately followed by at least a 1.
Examples of accepted words: 1011, 101101, 1111Example of non-accepted words: 101, 1001, 010The solution says the min-DFA contains 5 states but I could only do it in 4. Am...
User Avatar
0 votes
0 votes
1 answer
4
KingSAJ asked Jan 19, 2015
835 views
The number of states in a DFA accepting all the strings over {0,1} in which 5th symbol from right hand side is always '1' is?
Will the answer be $4$ or $2^5$?
User Avatar
Link Copied!