Variations on the post correspondence problem for free groups

DOI10.1007/978-3-030-81508-0_8OpenAlexW3197242144MaRDI QIDQ832925

Laura Ciobanu, Alan D. Logan

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2104.05772

zbMATH Keywords

free grouppost correspondence problemrational constraint

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Post's correspondence problem: from computer science to algebra ⋮ Post's Correspondence Problem for hyperbolic and virtually nilpotent groups ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Post correspondence problem in groups.
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• Generic-case complexity, decision problems in group theory, and random walks.
• Stallings foldings and subgroups of free groups
• Algorithmic constructions of relative train track maps and CTs
• Rational subsets of groups
• Fixed points and stable images of endomorphisms for the free group of rank two
• An algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group
• Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
• Fixed Subgroups of Homomorphisms of Free Groups
• A variant of a recursively unsolvable problem

This page was built for publication: Variations on the post correspondence problem for free groups