Glushkov Construction For Series: The Non Commutative Case

References

• Andary , P. , Caron , P. , Champamaud , J.-M. , Duchamp , G. , Flouret , M. and Laugerotte , E. Sea: A symbolic environment for automata theory . Automata Implementation: Fourth International Workshop on Implementing Automata, WIA'99 . volume 2214 , pp. 13 – 26 . Lecture Notes in Computer Science
   Google Scholar
• Berry , G. and Sethi , R. 1986 . From regular expressions to deterministic automata . Theoret. Comput Sci , 48 (1} ) : 117 – 126 .
   Web of Science ®Google Scholar
• Berstel , J. and Reutenauer , C. 1988 . Rational series and their languages. EATCS Monographs on Theoretical Computer Science , Berlin : Springer-Verlag .
   Google Scholar
• Briiggemann-Klein , A. 1993 . Regular expressions into finite automata . Theoret. Comput. Sci. , 120 (1} ) : 197 – 213 .
   Google Scholar
• Caron , P. and Flouret , M . Glushkov construction for multiplicities . Fifth International Conference on Implementation and Application of Automata, CIAA '00 . London , Ontario . volume 2088 , Berlin : Springer-Verlag . Lecture Notes in Computer Science
   Google Scholar
• Champamaud , J.-M. and Hansel , G. 1991 . Automate, a computing package for automata and finite semigroups . J. Symbolic Comput. , 12 : 197 – 220 .
   Web of Science ®Google Scholar
• Champamaud , J.-M. , Ponty , J.-L. and Ziadi , D. 1999 . From regular expressions to finite automata . Internat. J. Comput. Math. , 72 : 415 – 431 .
   Web of Science ®Google Scholar
• CulikII , K. and Kari , J. 1995 . “ Finite state transformations of images. ” . In Proceedings of ICALP 95 , Lecture Notes in Computer Science Vol. 944 ,
   Google Scholar
• Duchamp , G. , Flouret , M. , Laugerotte , E. and Luque , J.-G. 2001 . Direct and dual laws for automata with multiplicities . Theoret. Comput. Sci. , 267 (1-2} ) : 105 – 120 .
   Web of Science ®Google Scholar
• Eilenberg , S. 1974 . Automata, Languages and Machines , Vol. A. , New York : Academic Press .
   Google Scholar
• Glushkov , V. M. 1961 . The abstract theory of automata . Russian Mathematical Surveys , 16 : 1 – 53 .
   Google Scholar
• Hopcroft , J. E. and Ullman , J. D. 1979 . Introduction to Automata Theory, Languages and Computation , Reading , MA : Addison-Wesley .
   Google Scholar
• Kleene , S. 1956 . Representation of events in nerve nets and finite automata. Automata Studies , Ann. Math. Studies 34 3 – 41 . Princeton U. Press .
   Google Scholar
• McNaughton , R. F. and Yamada , H. 1960 . Regular expressions and state graphs for automata . IEEE Transactions on Electronic Computers , 9 : 39 – 57 .
   Google Scholar
• Mirkin , B. G. 1966 . An algorithm for constructing a base in a language of regular expressions . Engineering Cybernetics , S : 110 – 116 .
   Google Scholar
• Schützenberger , M. P. 1961 . On the definition of a family of automata . Inform, and Control , 4 : 245 – 270 .
   Google Scholar
• Thompson , K. 1968 . Regular expression search algorithm . Comm. ACM , 11 (6} ) : 419 – 422 .
   Web of Science ®Google Scholar