Pages that link to "Item:Q3210193"
From MaRDI portal
The following pages link to A geometrical view of the determinization and minimization of finite-state automata (Q3210193):
Displaying 8 items.
- An algebraic characterization of frontier testable tree languages (Q672861) (← links)
- Polynomial inference of universal automata from membership and equivalence queries (Q899316) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM (Q2941086) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- A Congruence-Based Perspective on Finite Tree Automata (Q5025071) (← links)
- ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON (Q5714672) (← links)
