Implementation and Application of Automata

DOI10.1007/11605157MaRDI QIDQ5897663zbMATH OpenOpenAlexFDO

Authors Parosh A. Abdulla, Johann Deneux, Lisa Kaati, Marcus Nilsson

Publication date 13 November 2006

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Bisimulation Minimization of Tree Automata
• BISIMULATION MINIMIZATION OF TREE AUTOMATA
• Aggregation-based minimization of finite state automata
• Simple bisimilarity minimization in \(O(m \log n)\) time
• Minimization of finite state automata through partition aggregation

Cited in

(13)

• Bisimilarity Minimization in O(m logn) Time
• scientific article; zbMATH DE number 1929949 (Why is no real title available?)
• Forward bisimulations for nondeterministic symbolic finite automata
• Aggregation-based minimization of finite state automata
• The tractability frontier for NFA minimization
• Regular expressions and transducers over alphabet-invariant and user-defined labels
• Simple bisimilarity minimization in \(O(m \log n)\) time
• A parallel relation-based algorithm for symbolic bisimulation minimization
• BISIMULATION MINIMIZATION OF TREE AUTOMATA
• Edge-minimization of non-deterministic finite automata
• From sequential extended regular expressions to NFA with symbolic labels
• scientific article; zbMATH DE number 1309169 (Why is no real title available?)
• An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata

This page was built for publication: Implementation and Application of Automata

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