2 votes 2 votes For $Σ$= {$a,b$}, construct dfa's that accept the sets consisting of (a) all strings with exactly one $a$, (b) all strings with at least one $a$, (c) all strings with no more than three $a$'s Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 19, 2019 edited Aug 24, 2019 by Shaik Masthan Naveen Kumar 3 4.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
5 votes 5 votes ........ abhishekmehta4u answered Mar 19, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.