AUTOMATE, a computing package for automata and finite semigroups
From MaRDI portal
Publication:1186737
DOI10.1016/S0747-7171(08)80125-3zbMath0804.68096MaRDI QIDQ1186737
Georges Hansel, Jean-Marc Champarnaud
Publication date: 28 June 1992
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Green's relationsfinite automatarational expressionsrational languageminimal automatontransition monoid
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items
Glushkov Construction For Series: The Non Commutative Case, The inverse identification problem and its technical application, Operational state complexity revisited: the contribution of monsters and modifiers, Computing finite semigroups, Some results on the dot-depth hierarchy, Some results on the generalized star-height problem, From regular expressions to finite automata∗, Subset construction complexity for homogeneous automata, position automata and ZPC-structures, Direct and dual laws for automata with multiplicities, COMPAS - A Computing Package for Synchronization, From Sequential Extended Regular Expressions to NFA with Symbolic Labels, AUTOMATE, Characterization of Glushkov automata, Re-describing an algorithm by Hopcroft, Green's equivalences in finite semigroups of binary relations, A conjecture on the concatenation product
Cites Work
- Inverse monoids of dot-depth two
- On the computational power of pushdown automata
- The Compilation of Regular Expressions into Integrated Circuits
- Compression of individual sequences via variable-rate coding
- New results on the generalized star-height problem
- Programming Techniques: Regular expression search algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
