Equations and regular-like expressions for afa

References

• Berry , G. and Sathi , R. 1986 . From regular expressions to deterministic automata . Theo. Comput. Sci. , 48 : 117 – 126 .
   Web of Science ®Google Scholar
• Brzozowski , J. A. 1986 . Derivatives of regular expressions . J. ACM , 11 ( 4 ) : 481 – 494 .
   Web of Science ®Google Scholar
• Brzozowski , J. A. and Leiss , E. 1980 . On equations for regular languages, finite automata, and sequential network . Theo. Comput. Sci , 10 ( 4 ) : 19 – 35 .
   Web of Science ®Google Scholar
• Chandra A. K. Kozen D. C. Stockmeyer L. J. Alternation IBM T. J. Watson Research Center Yorktown Heights, NY 1978 Res. Rept. R7489
   Google Scholar
• Chandra , A. K. , Kozen , D. C. and Stockmeyer , L.J. 1981 . Alternation . J. ACM , 28 ( 4 ) : 114 – 133 .
   Web of Science ®Google Scholar
• Fellah , A. , Jürgensen , H. and Yu , S. 1990 . Constructions for alternating finite automata . Inter. J. Computer Math. , 35 ( 4 ) : 117 – 132 .
   Web of Science ®Google Scholar
• Hopcrft J. E. Ullman D. C. indroduction to Automata Theory, Languages, and Computation Addison-Wesley Reading, MA 1979 4
   Google Scholar
• Salomaa A. Semirings, Automata, Languages Spring-Verlag Berlin 1986 35
   Google Scholar
• Salomaa , A. and Soittola , M. 1978 . Automata-Theoretic Aspects of Formal Power Series , Berlin : Springer-Verlag .
   Google Scholar