Forward Bisimulations for Nondeterministic Symbolic Finite Automata
No abstract available.
Related papers
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests POPL 2015
- Symbolic Automata: Omega-Regularity Modulo Theories POPL 2025
- Fresh-register automata POPL 2011
- Checking NFA equivalence with bisimulations up to congruence POPL 2013
- Symbolic Optimal Reachability in Weighted Timed Automata CAV 2016
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract APLAS 2007
- SMT-Based Active Learning of Weighted Automata CAV 2026
- Symbolic Register Automata CAV 2019