AMoRE
From MaRDI portal
Software:32793
swMATH20980MaRDI QIDQ32793FDOQ32793
Author name not available (Why is that?)
Cited In (12)
- Characterization of Glushkov automata
- Direct and dual laws for automata with multiplicities
- Circular Sturmian words and Hopcroft's algorithm
- Re-describing an algorithm by Hopcroft
- Title not available (Why is that?)
- On extremal cases of Hopcroft's algorithm
- From regular expressions to finite automata∗
- An efficient null-free procedure for deciding regular language membership
- On Extremal Cases of Hopcroft’s Algorithm
- Commutative images of rational languages and the Abelian kernel of a monoid
- Finite state automata: a geometric approach
- Type II theorem and hyperdecidability of pseudovarieties of groups
This page was built for software: AMoRE
