Finiteness Conditions and Structural Construction of Automata for All Process Algebras
No abstract available.
Related papers
- Searching entangled program spaces ICFP 2022
- Symbolic Automata: Omega-Regularity Modulo Theories POPL 2025
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests POPL 2015
- Automata-Driven Indexing of Prolog Clauses POPL 1990
- Monadic second-order logic on finite sequences POPL 2017
- Algebras for Deterministic Computation Are Inherently Incomplete POPL 2025
- SMT-Based Active Learning of Weighted Automata CAV 2026
- Lazy Automata Techniques for WS1S TACAS 2017