The following pages link to Minimization of symbolic automata (Q5408448):
Displaying 22 items.
- Symbolic tree automata (Q483051) (← links)
- Extended symbolic finite automata and transducers (Q746776) (← links)
- Abstract similarity analysis (Q1650963) (← links)
- Nested antichains for WS1S (Q1733101) (← links)
- Minimisation of automata (Q2074212) (← links)
- Adaptive testing for specification coverage and refinement in CPS models (Q2085163) (← links)
- A symbolic decision procedure for symbolic alternating finite automata (Q2130584) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Twinning automata and regular expressions for string static analysis (Q2234078) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Monadic Sequence Testing and Explicit Test-Refinements (Q2827440) (← links)
- Learning Symbolic Automata (Q3303893) (← links)
- Lazy Automata Techniques for WS1S (Q3303905) (← links)
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909) (← links)
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata (Q3303912) (← links)
- Enumerated BSP Automata (Q4686652) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5918382) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5919501) (← links)
- Inferring Symbolic Automata (Q6135753) (← links)
- Incremental dead state detection in logarithmic time (Q6535537) (← links)
- Symbolic solution of Emerson-Lei games for reactive synthesis (Q6629450) (← links)
- Translation of semi-extended regular expressions using derivatives (Q6666801) (← links)
