A geometrical view of the determinization and minimization of finite-state automata
From MaRDI portal
DOI10.1007/BF02090394zbMATH Open0722.68080MaRDI QIDQ3210193FDOQ3210193
Damian Niwiński, Bruno Courcelle, Andreas Podelski
Publication date: 1991
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Recommendations
minimizationdeterminizationtree automatonfinite-state wordrecognizability in algebraic structuresrectangular decompositions of relations
Cites Work
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A syntactic congruence for rational \(\omega\)-languages
- Finite-state \(\omega\)-languages
- Title not available (Why is that?)
- Algebraic automata and context-free sets
- Linear Automaton Transformations
Cited In (11)
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
- EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM
- A Congruence-Based Perspective on Finite Tree Automata
- Polynomial inference of universal automata from membership and equivalence queries
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
- Descriptional complexity of regular languages
- Finite state automata: a geometric approach
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
- Title not available (Why is that?)
- ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON
- An algebraic characterization of frontier testable tree languages
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)
