Pages that link to "Item:Q792454"

The following pages link to Groups, the theory of ends, and context-free languages (Q792454):

Displaying 50 items.

• Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
• The language of self-avoiding walks (Q2658381) (← links)
• Geodesic growth in virtually abelian groups (Q2659140) (← links)
• On the word problem for free products of semigroups and monoids (Q2693366) (← links)
• On a class of poly-context-free groups generated by automata (Q2700958) (← links)
• Embeddings into Thompson's group \(V\) and \(\mathrm{co}\mathcal{C}{F}\) groups (Q2835337) (← links)
• Free products in R. Thompson's group \(V\). (Q2849037) (← links)
• On Cayley graphs of virtually free groups. (Q2884691) (← links)
• Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups (Q2975251) (← links)
• GROWTHS OF ENDOMORPHISMS OF FINITELY GENERATED SEMIGROUPS (Q2986028) (← links)
• GROUPS WITH CONTEXT-FREE CONJUGACY PROBLEMS (Q2996844) (← links)
• THE IDEMPOTENT PROBLEM FOR AN INVERSE MONOID (Q3112585) (← links)
• Asymptotic invariants, complexity of groups and related problems (Q3143713) (← links)
• GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM (Q3146308) (← links)
• Growth and ergodicity of context-free languages (Q3151247) (← links)
• Context-Free Groups and Bass–Serre Theory (Q3295796) (← links)
• Solutions to twisted word equations and equations in virtually free groups (Q3299596) (← links)
• GROUPS WITH INDEXED CO-WORD PROBLEM (Q3421607) (← links)
• When Is a Graph Product of Groups Virtually-Free? (Q3429307) (← links)
• ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS (Q3502752) (← links)
• ON GROUPS AND COUNTER AUTOMATA (Q3601328) (← links)
• Formal Languages and Groups as Memory (Q3618533) (← links)
• Groups and Simple Languages (Q3667071) (← links)
• Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems (Q3708211) (← links)
• Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems (Q3741791) (← links)
• Commutativity in groups presented by finite Church-Rosser Thue systems (Q3794395) (← links)
• On a subclass of context-free groups (Q3978768) (← links)
• On the parallel complexity of linear groups (Q3988804) (← links)
• MULTIPLICATIVE MEASURES ON FREE GROUPS (Q4469600) (← 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)
• (Q5016373) (← links)
• (Q5021232) (← links)
• (Q5088964) (← links)
• Space Complexity and Word Problems of Groups (Q5189807) (← links)
• Anisimov's Theorem for inverse semigroups (Q5246502) (← links)
• ON GROUPS PRESENTED BY MONADIC REWRITING SYSTEMS WITH GENERATORS OF FINITE ORDER (Q5253345) (← links)
• Geometric characterizations of virtually free groups (Q5276027) (← links)
• The co-word problem for the Higman-Thompson group is context-free (Q5297606) (← links)
• EXTENDED FINITE AUTOMATA AND WORD PROBLEMS (Q5316306) (← links)
• A NOTE ON THE GRAMMAR OF COMBINGS (Q5316309) (← links)
• GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM (Q5322915) (← links)
• The loop problem for monoids and semigroups (Q5428377) (← links)
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) (← links)
• Subsemigroups of groups: presentations, Malcev presentations, and automatic structures (Q5480098) (← links)
• LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE (Q5483463) (← links)
• Groups Whose Word Problem is a Petri Net Language (Q5500697) (← links)