Variations on the post correspondence problem for free groups

DOI10.1007/978-3-030-81508-0_8MaRDI QIDQ832925zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3305031 (Why is no real title available?)
• A variant of a recursively unsolvable problem
• Algorithmic constructions of relative train track maps and CTs
• An algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group.
• Fixed Subgroups of Homomorphisms of Free Groups
• Fixed points and stable images of endomorphisms for the free group of rank two
• Generic-case complexity, decision problems in group theory, and random walks.
• Noneffective regularity of equality languages and bounded delay morphisms
• Rational subsets of groups
• Stallings foldings and subgroups of free groups
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• The Post correspondence problem in groups.
• Undecidability in binary tag systems and the Post correspondence problem for five pairs of words

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832925)