On Equivalence Checking of Nondeterministic Finite Automata
From MaRDI portal
(Redirected from Publication:5045387)
Recommendations
- On path equivalence of nondeterministic finite automata
- Checking NFA equivalence with bisimulations up to congruence
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- On the equivalence of stationary and finite-nonstationary nondeterministic automata
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- scientific article; zbMATH DE number 4203741
- Revisiting the equivalence problem for finite multitape automata
- Equivalence checking problem for finite state transducers over semigroups
- On completeness of nondeterministic automata
- Equivalence Checking of Non-deterministic Operations
Cited in
(13)- Equivalence checking of prefix-free transducers and deterministic two-tape automata
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
- Program equivalence checking by two-tape automata
- scientific article; zbMATH DE number 1670710 (Why is no real title available?)
- Checking NFA equivalence with bisimulations up to congruence
- Failure-based equivalence of constraint automata
- scientific article; zbMATH DE number 2163034 (Why is no real title available?)
- Testing the equivalence of regular languages
- scientific article; zbMATH DE number 2201363 (Why is no real title available?)
- Experimental Evaluation of Classical Automata Constructions
- Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification
- Reasoning About Regular Properties: A Comparative Study
- On concurrent program algebra and demonic automata
This page was built for publication: On Equivalence Checking of Nondeterministic Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045387)
