0 0 votes For this given 3 state machine, what will be the regular expressions for the following cases: When A is the final state. When B is the final state When C is the final state Theory of Computation + – Rhythm 607 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Rhythm commented Feb 20, 2019 reply Follow flag Please state the answer by right resolution. 0 0 replyShare Satbir commented Feb 20, 2019 reply Follow flag If A is final state, ($r1^{*}$r2 $r4^{*}r5 $$r7^{*}$)($\epsilon$ + $(r6 r4^{*} r5 r7^{*} )^{*}$ + $(r6 r3 r1^{*} r2 r4^{*}r5 r7^{*})^{*}$) 0 0 replyShare Please log in or register to add a comment.