scientific article
From MaRDI portal
Publication:3901701
zbMath0454.20048MaRDI QIDQ3901701
Juhani Karhumäki, Karel II Culik
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
periodicity forcing setsequality setPost's Correspondence Problemequations in free monoidsperiodic homomorphisms on free monoids
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)
Related Items
Ambiguity of Morphisms in a Free Group ⋮ Representations of language families by homomorphic equality operations and generalized equality sets ⋮ Closure properties of pattern languages ⋮ Large Simple Binary Equality Words ⋮ The (generalized) Post correspondence problem with lists consisting of two words is decidable ⋮ Periodicity forcing words ⋮ Post correspondence problem: Words possible as primitive solutions ⋮ Deciding whether a finite set of words has rank at most two ⋮ Formalizing a fragment of combinatorics on words ⋮ Binary equality words with two $b$'s ⋮ Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words ⋮ Fixed point languages of rational transductions ⋮ Systems of equations over a free monoid and Ehrenfeucht's conjecture ⋮ On binary equality sets and a solution to the test set conjecture in the binary case ⋮ The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids ⋮ Inverse morphic equivalence on languages ⋮ Unambiguous injective morphisms in free groups ⋮ Test sets for morphisms with bounded delay ⋮ Binary equality sets are generated by two words
