1 1 vote L = {ab3k | k>=0} wel, I think, this L is RL, as it has REGEX as a(bbb)*. Please correct me. Theory of Computation theory-of-computation identify-class-language context-free-language regular-language + – iarnav 537 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply srestha commented Sep 20, 2017 reply Follow flag u r right 2 2 replyShare saxena0612 commented Sep 20, 2017 reply Follow flag No of states : 6 (including dead state) where 2nd and 5th state are accepting and i assumed 6th dead one.Any correction. 0 0 replyShare Please log in or register to add a comment.
