GROUPS WITH INDEXED CO-WORD PROBLEM

DOI10.1142/S0218196706003359zbMath1151.20028MaRDI QIDQ3421607

Claas E. Röver, Derek F. Holt

Publication date: 7 February 2007

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

word problemfinite automataautomata groupsHigman-Thompson groupsindexed languagesnested stack automataco-word problemco-indexed groupstree automorphism groups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)

Related Items (9)

The (nested) word problem ⋮ The co-word problem for the Higman-Thompson group is context-free ⋮ Ideals of equations for elements in a free group and context-free languages ⋮ \(\mathcal C\)-graph automatic groups. ⋮ Groups whose word problems are accepted by abelian \(G\)-automata ⋮ A language hierarchy of binary relations ⋮ Applications of L systems to group theory ⋮ A dynamical definition of f.g. virtually free groups ⋮ Embeddings into Thompson's group V and coCF groups

Cites Work

• Unnamed Item
• Unnamed Item
• Groups, the theory of ends, and context-free languages
• Groups of piecewise linear homeomorphisms of the real line
• The accessibility of finitely presented groups
• On Burnside's problem on periodic groups
• The theory of ends, pushdown automata, and second-order logic
• Sur un groupe remarquable de difféomorphismes du cercle. (On a remarkable group of the diffeomorphisms of the circle)
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• The structure group for the associativity identity
• On the relationship between the problems of equality and divisibility of words for semigroups with a single defining relation
• GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata

This page was built for publication: GROUPS WITH INDEXED CO-WORD PROBLEM