Theory of computation :DFA for language where all strings ending in either ab or ba | TOC | Lect05

Design a DFA for a language over ∑={a, b} where all strings ending in either ‘ab’ or ‘ba’
Construction of DFA
Transition Table
Acceptance of a string
Rejection of a string

[@rajashri86]

Please give respectful comments. Thank you

[@riteshgurav]

Helpful video 👍🏻

[@rajashri86]

Thank you so much 🙏

[@akhilrajnr5801]

Thank you ma'am for explaining 👍

[@rajashri86]

Thank you 😊