0 votes 0 votes Give state diagrams of DFAs recognizing the following languages. In all parts, the alphabet is {0,1}. 1- {w| w starts with 0 and has odd length, or starts with 1 and has even length} Theory of Computation theory-of-computation finite-automata + – rania asked Feb 14 • edited 2 days ago by Shubham Sharma 2 rania 157 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The Regular Expression for the language would be :- (0 + ((0+1)(0+1))* ) + (1 + (0+1) ((0+1)(0+1))*) Sujith48 answered Feb 15 Sujith48 comment Share Follow See all 0 reply Please log in or register to add a comment.