On Conjugacy of Languages
From MaRDI portal
Recommendations
Cites work
- Codes conjugués
- Codes et motifs
- Compactness of Systems of Equations in Semigroups
- scientific article; zbMATH DE number 1670850 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1318043 (Why is no real title available?)
- scientific article; zbMATH DE number 1738654 (Why is no real title available?)
- scientific article; zbMATH DE number 3350192 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Satisfiability of word equations with constants is in NEXPTIME
- The commutation of finite sets: A challenging problem
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
Cited in
(11)- Conjugacy of finite biprefix codes
- Conjugacy of a prefix code to a biprefix code
- On languages defined by generalized principal right congruences
- Simple equations on binary factorial languages
- Conjugacy relations of prefix codes
- Towards Decidability of Conjugacy of Pairs and Triples
- scientific article; zbMATH DE number 58290 (Why is no real title available?)
- scientific article; zbMATH DE number 782020 (Why is no real title available?)
- scientific article; zbMATH DE number 846969 (Why is no real title available?)
- On languages satisfying “interchange Lemma”
- Deciding conjugacy of a rational relation (extended abstract)
This page was built for publication: On Conjugacy of Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147021)