1 votes 1 votes Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet {a,b}, such that every string ending with five b's. Theory of Computation finite-automata regular-language + – Abhi Girin asked Aug 25, 2017 Abhi Girin 284 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes pls correct me if wrong rdfan19 answered Aug 25, 2017 • selected Aug 28, 2017 by Abhi Girin rdfan19 comment Share Follow See 1 comment See all 1 1 comment reply air1ankit commented Aug 28, 2017 reply Follow Share perfect ..according to me 0 votes 0 votes Please log in or register to add a comment.
