1 votes 1 votes The following determiniotic finite automata recognizes: Set of all strings containing $’ab’$ Set of all strings containing $’aab’$ Set of all strings ending in $’abab’$ None of the above Others ugcnetcse-june2007-paper2 + – go_editor asked Mar 28, 2020 • edited May 21, 2021 by soujanyareddy13 go_editor 511 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes The given automata has no final states. Hence it accepts no strings. So option D is the answer chirudeepnamini answered Mar 29, 2020 chirudeepnamini comment Share Follow See all 0 reply Please log in or register to add a comment.