1 votes 1 votes what will be the regular expression of this DFA using Arden's theorem Theory of Computation theory-of-computation regular-expression + – prabhath challa asked Apr 18 • retagged Apr 18 by Shubham Sharma 2 prabhath challa answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes By State Elimination Method, Regular Expression= 0*1 . (0+1)* .1. (0*+0+1)* Here (.) In R.E means Concatenation. manishankarkanrar answered Apr 22 manishankarkanrar comment Share Follow See all 0 reply Please log in or register to add a comment.