Register

Design DFA contain all strings of a's and B's which each string starts with 'ab' and end with 'ab'.

357 views

1 Answer

2 votes
2 votes

I hope this is correct DFA, Thank you.a

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

Related questions

1 votes
1 votes
1 answer
2
Purple asked Jan 28, 2016
14,935 views
Regular expression for all strings starts with ab and ends with bba is.
Regular expression for all strings starts with ab and ends with bba is. a) aba*b*bba b) ab(ab)*bba c) ab(a+b)*bba d) All of the mentioned Doubt: starting with 'ab' and ending with 'bba', so 'abba' should also be accepted right?
Regular expression for all strings starts with ab and ends with bba is.a) aba*b*bbab) ab(ab)*bbac) ab(a+b)*bbad) All of the mentionedDoubt: starting with 'ab' and ending ...
User Avatar
1 votes
1 votes
0 answers
3
paressep28 asked Apr 25
91 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
Link Copied!