NFA reduction algorithms by means of regular inequalities
From MaRDI portal
Publication:703569
DOI10.1016/J.TCS.2004.02.048zbMATH Open1071.68039OpenAlexW2102066200MaRDI QIDQ703569FDOQ703569
Authors: Jean-Marc Champarnaud, Fabien Coulon 
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.048
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal NFA Problems are Hard
- Title not available (Why is that?)
- On the State Minimization of Nondeterministic Finite Automata
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compact and fast algorithms for safe regular expression search
- Rewriting regular inequalities
Cited In (21)
- Left is Better Than Right for Reducing Nondeterminism of NFAs
- The best nondeterministic representations of finite orderings.
- Minimal NFA and biRFSA Languages
- A search algorithm for subshift attractors of cellular automata
- Bisimulations for fuzzy automata
- Title not available (Why is that?)
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Theory Is Forever
- On size reduction techniques for multitape automata
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- Fuzzy relation equations and reduction of fuzzy automata
- Title not available (Why is that?)
- Construction of fuzzy automata from fuzzy regular expressions
- Left is better than right for reducing nondeterminism of NFAs
- A non-deterministic finite automata minimization method based on the preorder relation
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
- Minimizing nfa's and regular expressions
- Combinatorial Pattern Matching
- Further improvements of determinization methods for fuzzy finite automata
This page was built for publication: NFA reduction algorithms by means of regular inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703569)
