The Commutation with Codes and Ternary Sets of Words-Reference-Cited by-同舟云学术

The Commutation with Codes and Ternary Sets of Words

Published:2003 Issue: Volume: Page:74-84
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Karhumäki Juhani,Latteux Michel,Petre Ion

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36494-3_8

Reference23 articles.

1. Autebert, J.M., Boasson, L., Latteux, M.: Motifs et bases de langages, RAIRO Inform. Theor., 23(4) (1989) 379–393.

2. Bergman, G.: Centralizers in free associative algebras, Transactions of the American Mathematical Society 137 (1969) 327–344.

3. Berstel, J., Perrin, D.: Theory of Codes, Academic Press, New York (1985).

4. Choffrut, C., Karhumäki, J.: Combinatorics of Words. In Rozenberg, G., Salomaa, A. (eds.), Handbook of Formal Languages, Vol. 1, Springer-Verlag (1997) 329–438.

5. Choffrut, C., Karhumäki, J.: On Fatou properties of rational languages, in Martin-Vide, C., Mitrana, V. (eds.), Where mathematics, Computer Science, Linguistics and Biology Meet, Kluwer, Dordrecht (2000).

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the proportion of prefix codes in the set of three-element codes;Discrete Mathematics;2020-08

2. On the complexity of decidable cases of the commutation problem of languages;Theoretical Computer Science;2005-06

3. Finite Sets of Words and Computing;Lecture Notes in Computer Science;2005

4. Three-element codes with one d-primitive word;Acta Informatica;2004-12

5. Fixed Point Approach to Commutation of Languages;Aspects of Molecular Computing;2003