0 0 votes Theory of Computation theory-of-computation regular-grammar finite-automata + – Çșȇ ʛấẗẻ 621 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply vedantk commented Nov 23, 2023 reply Follow flag The given automata above accepts every string in w belongs to (a,b)^+ in which the length of b is always odd. 0 0 replyShare prajjwal_191 commented Nov 23, 2023 reply Follow flag Regular expression : a*b(bb)* 0 0 replyShare Please log in or register to add a comment.
0 0 votes S → aS | B B → bbB | b mili_dhara answered Dec 23, 2023 mili_dhara comment Share Follow 0 reply Please log in or register to add a comment.