Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Albert, M. H. and Lawrence, J., A proof of Ehrenfeucht’s Conjecture, Theoret. Comput. Sci 41, pp. 121–123, 1985.
2. Bergman, G. Centralizers in free associative algebras, Transactions of the American Mathematical Society 137, pp. 327–344, 1969.
3. Cassaigne, J., Karhumäki, J., and Manuch, J., On conjugacy of languages, manuscript in preparation.
4. Crochemore, M. and Rytter, W., Text Algorithms, Oxford University Press, 1994.
5. Choffrut, C. and Karhumäki, J., Combinatorics on Words. In G. Rozenberg, A. Salomaa (eds.) Handbook of Formal Languages, vol 1, pp. 329–438, Springer-Verlag 1997.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deciding Conjugacy of a Rational Relation;Lecture Notes in Computer Science;2024
2. Conjugacy relations of prefix codes;Theoretical Computer Science;2016-07
3. Conjugacy of finite biprefix codes;Theoretical Computer Science;2009-05
4. On the complexity of decidable cases of the commutation problem of languages;Theoretical Computer Science;2005-06
5. On Conjugacy of Languages;RAIRO - Theoretical Informatics and Applications;2001-11