The following pages link to Groups and NTS languages (Q580992):
Displaying 16 items.
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
- A note on regular classes in special Thue systems (Q1116708) (← links)
- Some remarks on a theorem of Sakarovitch (Q1185250) (← 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)
- On the rational subsets of the free group (Q1924996) (← links)
- Gilman's conjecture (Q1989814) (← links)
- When Is a Graph Product of Groups Virtually-Free? (Q3429307) (← links)
- On a subclass of context-free groups (Q3978768) (← links)
- An effective version of Stallings' theorem in the case of context-free groups (Q4630285) (← links)
- Space Complexity and Word Problems of Groups (Q5189807) (← links)
- Groups Whose Word Problem is a Petri Net Language (Q5500697) (← links)
- Conjugacy languages in virtual graph products (Q6052936) (← links)
