The following pages link to (Q4737901):
Displayed 13 items.
- Linearly bounded infinite graphs (Q852011) (← links)
- On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
- Morphisms on infinite alphabets, countable states automata and regular sequences (Q1674337) (← links)
- The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
- Some properties of the Fibonacci sequence on an infinite alphabet (Q2363115) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Arithmetics properties of substitutions and infinite automata (Q2372784) (← links)
- Verification of opacity and diagnosability for pushdown systems (Q2375627) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- Unary Automatic Graphs: An Algorithmic Perspective (Q3502677) (← links)
- An Infinite Automaton Characterization of Double Exponential Time (Q3540169) (← links)
- (Q5013878) (← links)