Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Hamsho
0
votes
0
answers
1
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)
362
views
asked
Jun 11, 2022
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register