Pages that link to "Item:Q792454"
From MaRDI portal
The following pages link to Groups, the theory of ends, and context-free languages (Q792454):
Displaying 50 items.
- 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)
- Multipass automata and group word problems (Q495997) (← links)
- The large scale geometry of strongly aperiodic subshifts of finite type (Q507216) (← links)
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group (Q557909) (← links)
- Groups and NTS languages (Q580992) (← links)
- On groups whose word problem is solved by a counter automaton. (Q596085) (← links)
- Context-free pairs of groups. II: Cuts, tree sets, and random walks (Q658032) (← links)
- Automorphism groups of context-free graphs (Q671518) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- On mathematical contributions of Paul E. Schupp (Q716386) (← links)
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- Sur les monoides à un relateur qui sont des groupes (Q801040) (← links)
- On the rational subset problem for groups. (Q875109) (← links)
- Graphs and groups with tree-like properties (Q910412) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Malcev presentations for subsemigroups of direct products of coherent groups. (Q1008745) (← links)
- A note on a special one-rule semi-Thue system (Q1067781) (← links)
- The theory of ends, pushdown automata, and second-order logic (Q1084096) (← links)
- Context-free languages and random walks on groups (Q1098476) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
- The complexity of Grigorchuk groups with application to cryptography (Q1177176) (← links)
- Some remarks on a theorem of Sakarovitch (Q1185250) (← links)
- On a kind of Fatou property of context-free groups (Q1186612) (← links)
- Group presentations, formal languages and characterizations of one- counter groups (Q1210289) (← links)
- Computing presentations for subgroups of polycyclic groups and of context-free groups (Q1328439) (← links)
- Word problems of groups: formal languages, characterizations and decidability (Q1623276) (← links)
- The word problem of \(\mathbb{Z}^n\) is a multiple context-free language (Q1647858) (← links)
- The generalised word problem in hyperbolic and relatively hyperbolic groups (Q1799015) (← links)
- On some variants of the Ehrenfeucht conjecture (Q1822520) (← links)
- On the rational subsets of the free group (Q1924996) (← links)
- Gilman's conjecture (Q1989814) (← links)
- Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs (Q2079248) (← links)
- Non-finitely generated maximal subgroups of context-free monoids (Q2099288) (← links)
- Regular left-orders on groups (Q2102171) (← links)
- \(O_n\) is an \(n\)-MCFL (Q2121469) (← links)
- The complexity of solution sets to equations in hyperbolic groups (Q2130524) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- On the complexity of the cogrowth sequence (Q2181189) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Groups whose word problems are not semilinear (Q2317163) (← links)
- On finitely generated submonoids of virtually free groups (Q2317164) (← links)
- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies (Q2353402) (← links)
- Specular sets (Q2358694) (← links)
- The loop problem for Rees matrix semigroups. (Q2481325) (← links)
- Word problems recognisable by deterministic blind monoid automata (Q2508978) (← links)
- The (nested) word problem (Q2630345) (← links)
