Ambiguity of Morphisms in a Free Group

DOI10.1007/978-3-319-23660-5_9zbMath1330.68186OpenAlexW2259115812MaRDI QIDQ3449361

Daniel Reidenbach, Joel D. Day

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23660-5_9

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Free nonabelian groups (20E05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discontinuities in pattern inference
• The unambiguity of segmented morphisms
• Morphically primitive words
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• On certain elements of free groups
• On certain \(C\)-test words for free groups
• Decision problems for patterns
• The Complexity of Verbal Languages over Groups
• EQUATIONS IN A FREE GROUP
• ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS
• Equations in a free semigroup
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• Test Words for Automorphisms of Free Groups
• Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
• A variant of a recursively unsolvable problem

This page was built for publication: Ambiguity of Morphisms in a Free Group