Pages that link to "Item:Q1084096"

The following pages link to The theory of ends, pushdown automata, and second-order logic (Q1084096):

Displaying 46 items.

• Model-checking CTL* over flat Presburger counter systems (Q2901199) (← links)
• GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM (Q3146308) (← links)
• Growth and ergodicity of context-free languages (Q3151247) (← links)
• Model Checking Procedural Programs (Q3176375) (← links)
• Synchronization of Regular Automata (Q3182910) (← links)
• The Reachability Problem over Infinite Graphs (Q3392937) (← links)
• GROUPS WITH INDEXED CO-WORD PROBLEM (Q3421607) (← links)
• When Is a Graph Product of Groups Virtually-Free? (Q3429307) (← links)
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
• Graphes canoniques de graphes algébriques (Q3479542) (← links)
• ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS (Q3502752) (← links)
• Complete SAT-Based Model Checking for Context-Free Processes (Q3510785) (← 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)
• COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES (Q3552516) (← links)
• An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
• Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
• Model checking the full modal mu-calculus for infinite sequential processes (Q4571973) (← links)
• About the Domino Problem for Subshifts on Groups (Q4613553) (← links)
• An effective version of Stallings' theorem in the case of context-free groups (Q4630285) (← links)
• WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM (Q4786246) (← links)
• ON GROUPS WHICH ARE SYNTACTIC MONOIDS OF DETERMINISTIC CONTEXT-FREE LANGUAGES (Q4824702) (← links)
• CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES (Q4923204) (← links)
• The isomorphism problem for finite extensions of free groups is in PSPACE (Q5002826) (← links)
• (Q5015280) (← links)
• Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
• (Q5090942) (← links)
• (Q5092408) (← links)
• Set-theoretic graph rewriting (Q5096290) (← links)
• Context-free event domains are recognizable (Q5096387) (← links)
• On Cayley graphs of basic algebraic structures (Q5113594) (← links)
• Space Complexity and Word Problems of Groups (Q5189807) (← links)
• Reflections on a Geometry of Processes (Q5262964) (← links)
• Geometric characterizations of virtually free groups (Q5276027) (← links)
• EQUATIONS IN FREE INVERSE MONOIDS (Q5386970) (← links)
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) (← links)
• LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE (Q5483463) (← links)
• Self-avoiding walks and multiple context-free languages (Q5886265) (← links)
• Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5892174) (← links)
• Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255) (← links)
• Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
• Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
• On the Petri net realization of context-free graphs (Q5941208) (← links)
• Vertex separators, chordality and virtually free groups (Q6089235) (← links)
• Decidability results in automata and process theory (Q6560390) (← links)
• On groups whose cogrowth series is the diagonal of a rational series (Q6660946) (← links)