The following pages link to (Q4818835):
Displayed 22 items.
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- Regular sets over extended tree structures (Q764339) (← links)
- Linearly bounded infinite graphs (Q852011) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- On the transition graphs of Turing machines. (Q1401268) (← links)
- Analyzing pushdown systems with stack manipulation (Q1706143) (← links)
- Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
- Model checking the full modal mu-calculus for infinite sequential processes (Q1960527) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- Rewriting higher-order stack trees (Q2411043) (← links)
- Deciding regular grammar logics with converse through first-order logic (Q2567343) (← links)
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
- (Q2842873) (← links)
- (Q2842874) (← links)
- (Q2842876) (← links)
- Simple monadic theories and partition width (Q3170562) (← links)
- Rewriting Higher-Order Stack Trees (Q3194729) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- An Infinite Automaton Characterization of Double Exponential Time (Q3540169) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Automata-based Representations for Infinite Graphs (Q4331049) (← links)
- Model checking the full modal mu-calculus for infinite sequential processes (Q4571973) (← links)