scientific article; zbMATH DE number 3710436

MaRDI QIDQ3901701zbMATH OpenFDO

Authors Karel II Culik, Juhani Karhumäki

Publication date 1980

zbMATH Keywords

equality setequations in free monoidsperiodic homomorphisms on free monoidsperiodicity forcing setsPost's Correspondence Problem

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Formal languages and automata (68Q45)

Cited in

(19)

• On binary equality sets and a solution to the test set conjecture in the binary case
• Inverse morphic equivalence on languages
• Test sets for morphisms with bounded delay
• Representations of language families by homomorphic equality operations and generalized equality sets
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• Deciding whether a finite set of words has rank at most two
• Fixed point languages of rational transductions
• Binary equality sets are generated by two words
• Formalizing a fragment of combinatorics on words
• Unambiguous injective morphisms in free groups
• Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words
• Closure properties of pattern languages
• Ambiguity of morphisms in a free group
• Large Simple Binary Equality Words
• Post correspondence problem: words possible as primitive solutions
• Binary equality words with two b's.
• Periodicity forcing words
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids

This page was built for publication:

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