Maximal and minimal solutions to language equations

Journal of Computer and System Sciences

Volumn 53, Issue 3, 1996, Pages 487-496

  Kari, Lila ^a   Thierrin, Gabriel ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; BINARY CODES; BINARY SEQUENCES; PROBLEM SOLVING; SET THEORY;

BINARY WORD OPERATION; LANGUAGE EQUATIONS;

QUERY LANGUAGES;

EID: 0030416372     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0082     Document Type: Article

References (8)

1. J. H. Conway, "Regular Algebra and Finite Machines," Chapman & Hall, London, 1971.
2. M. Ito and G. Thierrin, Congruences, infix and cohesive prefix codes, Theoret. Comput. Sci. 136 (1994), 471-485.
3. L. Kari, "On Insertion and Deletion in Formal Languages," Ph.D. thesis, University of Turku, Finland, 1991.
4. L. Kari, On language equations with invertible operations, Theoret. Comput. Sci. 132 (1994), 129-150.
5. L. Kari and G. Thierrin, K-catenation and applications: k-prefix codes, J. Inform. Optim. Sci. 16, No. 2 (1995), 263-276.
6. A. Salomaa, "Formal Languages," Academic Press, London, 1973.
7. H. J. Shyr, "Free Monoids and Languages," Institute of Applied Mathematics, National Chung-Hsing University, Taichung, Taiwan, 1991.
8. G. Thierrin, Décompositions des langages réguliers, Rev. Inform. Recherche Opér. 2-3 (1969), 45-50.