Pages that link to "Item:Q1084096"
From MaRDI portal
The following pages link to The theory of ends, pushdown automata, and second-order logic (Q1084096):
Displaying 50 items.
- Cellular automata between sofic tree shifts (Q393113) (← links)
- Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions (Q410708) (← links)
- Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
- Context-free pairs of groups. I: Context-free pairs and graphs (Q444402) (← links)
- The large scale geometry of strongly aperiodic subshifts of finite type (Q507216) (← links)
- On groups whose word problem is solved by a counter automaton. (Q596085) (← links)
- Properties and limits of recognition of sets of integers by countable automata (Q628831) (← links)
- Context-free pairs of groups. II: Cuts, tree sets, and random walks (Q658032) (← links)
- Automorphism groups of context-free graphs (Q671518) (← links)
- On the regular structure of prefix rewriting (Q685354) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- On mathematical contributions of Paul E. Schupp (Q716386) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- Linearly bounded infinite graphs (Q852011) (← links)
- On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- Pushdown module checking (Q968362) (← links)
- Note on winning positions on pushdown games with \(\omega\)-regular conditions (Q1007544) (← links)
- Alternating automata, the weak monadic theory of trees and its complexity (Q1193871) (← links)
- Infinite hypergraphs. II: Systems of recursive equations (Q1199532) (← links)
- Group presentations, formal languages and characterizations of one- counter groups (Q1210289) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- Context-free event domains are recognizable (Q1286370) (← links)
- On the transition graphs of Turing machines. (Q1401268) (← links)
- Growth-sensitivity of context-free languages. (Q1426039) (← links)
- Word problems of groups: formal languages, characterizations and decidability (Q1623276) (← links)
- Amalgams of finite inverse semigroups and deterministic context-free languages. (Q1758227) (← links)
- Families of automata characterizing context-sensitive languages (Q1772107) (← links)
- Infinite hypergraphs. I: Basic properties (Q1814126) (← links)
- On infinite transition graphs having a decidable monadic theory (Q1853615) (← links)
- Pushdown processes: Games and model-checking (Q1854405) (← links)
- Simulation preorder over simple process algebras (Q1854513) (← links)
- Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
- Model checking the full modal mu-calculus for infinite sequential processes (Q1960527) (← links)
- Shelah-Stupp's and Muchnik's iterations revisited (Q2117107) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- A counterexample to Thiagarajan's conjecture on regular event structures (Q2186822) (← links)
- Modular strategies for recursive game graphs (Q2368953) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- Marking shortest paths on pushdown graphs does not preserve MSO decidability (Q2629775) (← links)
- Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
- The language of self-avoiding walks (Q2658381) (← links)
- Monadic second-order logic and the domino problem on self-similar graphs (Q2694796) (← links)
- On a class of poly-context-free groups generated by automata (Q2700958) (← links)
- Embeddings into Thompson's group <i>V</i> and coCF groups (Q2835337) (← links)
- (Q2842873) (← links)
- (Q2842874) (← links)
- Free products in R. Thompson’s group 𝑉 (Q2849037) (← links)
