Cited in
(20)- On Extremal Cases of Hopcroft’s Algorithm
- Commutative images of rational languages and the Abelian kernel of a monoid
- Direct and dual laws for automata with multiplicities
- Characterization of Glushkov automata
- Type II theorem and hyperdecidability of pseudovarieties of groups
- Finite state automata: a geometric approach
- From regular expressions to finite automata∗
- AUTOMATE
- Grail
- LANGAGE
- Circular Sturmian words and Hopcroft's algorithm
- TESTAS
- automata
- MONOiD
- AG
- On extremal cases of Hopcroft's algorithm
- Semigroupe
- Re-describing an algorithm by Hopcroft
- An efficient null-free procedure for deciding regular language membership
- scientific article; zbMATH DE number 1262447 (Why is no real title available?)
This page was built for software: AMoRE
