A DFA accepts strings ending with 'abba' over the input alphabet Σ = {a, b}. a) Construct the state transition diagram f
Posted: Wed Jul 06, 2022 11:50 am
- 1 (31.32 KiB) Viewed 11 times
A DFA accepts strings ending with 'abba' over the input alphabet Σ = {a, b}. a) Construct the state transition diagram for this DFA. b) Show the working of the DFA on the strings X whether each string is accepted. = abbaab and Y = (24 marks) bbabba. State (2 marks)