A geometrical view of the determinization and minimization of finite-state automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3186871 (Why is no real title available?)
- A syntactic congruence for rational \(\omega\)-languages
- Algebraic automata and context-free sets
- Finite-state \(\omega\)-languages
- Linear Automaton Transformations
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Cited in
(11)- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
- A congruence-based perspective on finite tree automata
- Finite state automata: a geometric approach
- ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON
- An algebraic characterization of frontier testable tree languages
- Polynomial inference of universal automata from membership and equivalence queries
- Descriptional complexity of regular languages
- Efficient deterministic finite automata split-minimization derived from Brzozowski's algorithm
- scientific article; zbMATH DE number 6379024 (Why is no real title available?)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
This page was built for publication: A geometrical view of the determinization and minimization of finite-state automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210193)
