Variations on the post correspondence problem for free groups
From MaRDI portal
(Redirected from Publication:832925)
Cites work
- 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 points and stable images of endomorphisms for the free group of rank two
- Fixed Subgroups of Homomorphisms of Free Groups
- Generic-case complexity, decision problems in group theory, and random walks.
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3305031 (Why is no real title available?)
- 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
(6)- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
- Post's correspondence problem: from computer science to algebra
- Post's Correspondence Problem for hyperbolic and virtually nilpotent groups
- Variations on the Post Correspondence Problem for free groups
- Contributions to the domino problem: seeding, recurrence and satisfiability
- On the intersection of fixed subgroups of F_n F_m
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)
