SEA: A Symbolic Environment for Automata Theory

We here present the system SEA which integrates manipulations over boolean and multiplicity automata. The system provides also self development facilities.

[1]  Jean-Marc Champarnaud,et al.  AUTOMATE, a Computing Package for Automata and Finite Semigroups , 1991, J. Symb. Comput..

[2]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[3]  Samuel Eilenberg.  Automata, Languages and Machines, Vol. B , 1976 .

[4]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[5]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[6]  Éric Laugerotte,et al.  Operations over Automata with Multiplicities , 1998, Workshop on Implementing Automata.

[7]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[8]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[9]  J. Berstel,et al.  Theory of codes , 1985 .

[10]  Éric Laugerotte,et al.  Noncommutative Minimization Algorithms , 1997, Inf. Process. Lett..

[11]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[12]  Pascal Caron.  AG: a set of Maple packages for manipulating automata and semigroups , 1997 .

[13]  M. Schützenberger.  On a Theorem of R. Jungen , 1962 .

[14]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[15]  Derick Wood,et al.  Grail: A C++ Library for Automata and Expressions , 1994, J. Symb. Comput..

[16]  M. Lothaire,et al.  Combinatorics on words: Frontmatter , 1997 .