Pages that link to "Item:Q4412836"
From MaRDI portal
The following pages link to The Complexity of Translating Logic to Finite Automata (Q4412836):
Displaying 10 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Automata on finite trees (Q2074209) (← links)
- Defining long words succinctly in FO and MSO (Q2104260) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- On long words avoiding Zimin patterns (Q2321925) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- (Q5155665) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
