The following pages link to AMoRE (Q32793):
Displaying 12 items.
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- An efficient null-free procedure for deciding regular language membership (Q1575893) (← links)
- Characterization of Glushkov automata (Q1575946) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← links)
- (Q2704706) (← links)
- Finite state automata: A geometric approach (Q2716145) (← links)
- Commutative images of rational languages and the Abelian kernel of a monoid (Q3149083) (← links)
- On Extremal Cases of Hopcroft’s Algorithm (Q3637337) (← links)
- (Q4232495) (← links)
- From regular expressions to finite automata<sup>∗</sup> (Q4944659) (← links)
- Direct and dual laws for automata with multiplicities (Q5958727) (← links)
