On NFA reductions

DOI10.1007/978-3-540-27812-2_11MaRDI QIDQ5894870zbMATH OpenOpenAlexFDO

Authors Lucian Ilie, Gonzalo Navarro, Sheng Yu

Publication date 18 January 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98751

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Reducing the size of NFAs by using equivalences and preorders
• NFA reduction algorithms by means of regular inequalities
• NFA reduction algorithms by means of regular inequalities
• Reducing NFAs by invariant equivalences.
• Algorithms for computing small NFAs

Cited in

(29)

• Reducing NFAs by invariant equivalences.
• Construction of fuzzy automata from fuzzy regular expressions
• Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
• Minimizing nfa's and regular expressions
• From sequential extended regular expressions to NFA with symbolic labels
• Left is better than right for reducing nondeterminism of NFAs
• scientific article; zbMATH DE number 5309908 (Why is no real title available?)
• On regular expression hashing to reduce FA size
• Edmonds-Karp
• Flow Networks
• Gabow SCC
• Bisimulations for fuzzy automata
• AI 2003: Advances in Artificial Intelligence
• Prpu_Maxflow
• BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
• Brute force determinization of NFAs by means of state covers
• Reducing the size of NFAs by using equivalences and preorders
• Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
• Left is Better Than Right for Reducing Nondeterminism of NFAs
• On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
• Reasoning About Regular Properties: A Comparative Study
• Further improvements of determinization methods for fuzzy finite automata
• New insights into opacity verification in timed discrete-event systems
• NFA reduction algorithms by means of regular inequalities
• On size reduction techniques for multitape automata
• Obtaining shorter regular expressions from finite-state automata
• Nondeterministic automata: equivalence, bisimulations, and uniform relations
• A search algorithm for subshift attractors of cellular automata
• Fuzzy relation equations and reduction of fuzzy automata

This page was built for publication: On NFA reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894870)