29
Views
15
CrossRef citations to date
0
Altmetric
Original Articles

Relations on free monoids, their independent sets, and codesFootnote1

&
Pages 17-46 | Received 23 Nov 1990, Published online: 20 Mar 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

Chunhua Cao, Ling Li & Di Yang. (2019) A free monoid containing all strongly Bi-singular languages and non-primitive words. International Journal of Computer Mathematics: Computer Systems Theory 4:1, pages 57-66.
Read now
H. Jürgensen, L. Kari & G. Thierrin. (2001) Morphisms preserving densities. International Journal of Computer Mathematics 78:2, pages 65-189.
Read now

Articles from other publishers (13)

Haiyan Liu, Rongdong Cui & Tianjie Zhang. (2023) n-PS-codes, 2-infix-outfix codes and some related classes of codes. Acta Informatica 61:1, pages 67-81.
Crossref
Jean Néraud. (2022) Variable-length codes independent or closed with respect to edit relations. Information and Computation 288, pages 104747.
Crossref
Chen-Ming Fan, Jen-Tse Wang & Cheng-Chih Huang. (2014) Some properties of involution binary relations. Acta Informatica 52:6, pages 483-495.
Crossref
Mark Daley, Helmut Jürgensen, Lila Kari & Kalpana Mahalingam. (2012) Relativized codes. Theoretical Computer Science 429, pages 54-64.
Crossref
KRYSTIAN DUDZINSKI & STAVROS KONSTANTINIDIS. (2012) FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION. International Journal of Foundations of Computer Science 23:01, pages 67-85.
Crossref
Janusz Brzozowski, Jeffrey Shallit & Zhi Xu. (2011) Decision problems for convex languages. Information and Computation 209:3, pages 353-367.
Crossref
Janusz Brzozowski. 2010. Language and Automata Theory and Applications. Language and Automata Theory and Applications 1 15 .
Michael Domaratzki & Kai Salomaa. (2006) Codes defined by multiple sets of trajectories. Theoretical Computer Science 366:3, pages 182-193.
Crossref
H.K. Hsiao, Y.T. Yeh & S.S. Yu. (2005) Dependences related to strict binary relations. Theoretical Computer Science 347:1-2, pages 306-324.
Crossref
H. Jürgensen & S. Konstantinidis. 1995. Automata, Languages and Programming. Automata, Languages and Programming 581 592 .
H. Jürgensen, K. Salomaa & S. Yu. (1994) Transducers and the decidability of independence in free monoids. Theoretical Computer Science 134:1, pages 107-117.
Crossref
C. Calude, H. Jürgensen & M. Zimand. (1994) Is independence an exception?. Applied Mathematics and Computation 66:1, pages 63-76.
Crossref
H. Jürgensen & S. Konstantinidis. 1993. Fundamentals of Computation Theory. Fundamentals of Computation Theory 50 68 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.