Register

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?

71 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
2
KingSAJ asked Jan 19, 2015
833 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
0 votes
0 votes
0 answers
3
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
3 votes
3 votes
2 answers
4
im.raj asked Jun 16, 2016
21,088 views
Write regular expression to denote a language L which accepts all the strings which begin or end with either 00 or 11
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).
User Avatar
Link Copied!