How to translate this deterministic finite state automata into a regular expression..

68 Views Asked by At

What is this Finite state automata represented as a regular expression.

Click here for FSA image

1

There are 1 best solutions below

0
On BEST ANSWER

A possible regular expression is:

$R = (0|2)^*1(0|2)^*(1(0|2)^*1(0|2)^*)^*$