Theory of computation : How to Construct a DFA explanation with different example | TOC | Lect 09

Design a DFA for a language over ∑={a,b} where all strings
1. either ends with ‘ab’ or ‘ba’.
2. either ends with ‘aa’ or ‘bb ’
3. neither ‘aa’ or ‘bb’ as a substring

[@jagatheeshmenon5295]

Nice explanation. Could you also please explain for "neither aa(00) nor ab(01) as substrings

[@roshanpatil6730]

Nice

[@rajashri86]

Thank you 😊