scientific article; zbMATH DE number 3710436
From MaRDI portal
Publication:3901701
zbMATH Open0454.20048MaRDI QIDQ3901701FDOQ3901701
Authors: Karel II Culik, Juhani Karhumäki 
Publication date: 1980
Title of this publication is not available (Why is that?)
equality setperiodicity forcing setsPost's Correspondence Problemequations in free monoidsperiodic homomorphisms on free monoids
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)
Cited In (19)
- Fixed point languages of rational transductions
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
- Representations of language families by homomorphic equality operations and generalized equality sets
- On binary equality sets and a solution to the test set conjecture in the binary case
- Unambiguous injective morphisms in free groups
- Binary equality sets are generated by two words
- 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
- Post correspondence problem: words possible as primitive solutions
- Large Simple Binary Equality Words
- Closure properties of pattern languages
- Test sets for morphisms with bounded delay
- Ambiguity of morphisms in a free group
- Periodicity forcing words
- Inverse morphic equivalence on languages
- Deciding whether a finite set of words has rank at most two
- The (generalized) Post correspondence problem with lists consisting of two words is decidable
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)
