Implementation and Application of Automata
From MaRDI portal
Publication:5897663
DOI10.1007/11605157zbMATH Open1172.68488OpenAlexW2544597226MaRDI QIDQ5897663FDOQ5897663
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
Recommendations
Cited In (13)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Bisimilarity Minimization in O(m logn) Time
- 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)