Minimization of symbolic automata
From MaRDI portal
Publication:5408448
DOI10.1145/2535838.2535849zbMath1284.68347OpenAlexW2110117589MaRDI QIDQ5408448
Publication date: 10 April 2014
Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2535838.2535849
Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Descriptive complexity and finite models (68Q19)
Related Items (20)
A symbolic decision procedure for symbolic alternating finite automata ⋮ Abstract similarity analysis ⋮ Inferring Symbolic Automata ⋮ Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation ⋮ Symbolic tree automata ⋮ Nested antichains for WS1S ⋮ Nondeterministic and co-nondeterministic implies deterministic, for data languages ⋮ Twinning automata and regular expressions for string static analysis ⋮ Learning Symbolic Automata ⋮ Lazy Automata Techniques for WS1S ⋮ Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ Forward Bisimulations for Nondeterministic Symbolic Finite Automata ⋮ Enumerated BSP Automata ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure ⋮ Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure ⋮ Extended symbolic finite automata and transducers ⋮ Monadic Sequence Testing and Explicit Test-Refinements ⋮ Minimisation of automata ⋮ Adaptive testing for specification coverage and refinement in CPS models
This page was built for publication: Minimization of symbolic automata
