MAXIMAL AND MINIMAL SOLUTIONS TO LANGUAGE EQUATIONS

Authors
KARI L THIERRIN G
Citation
L. Kari et G. Thierrin, MAXIMAL AND MINIMAL SOLUTIONS TO LANGUAGE EQUATIONS, Journal of computer and system sciences, 53(3), 1996, pp. 487-496
Citations number
8
Categorie Soggetti
System Science","Computer Science Hardware & Architecture","Computer Science Theory & Methods
Journal title
Journal of computer and system sciences → ACNP
ISSN journal
00220000
Volume
53
Issue
3
Year of publication
1996
Pages
487 - 496
Database
ISI
SICI code
0022-0000(1996)53:3<487:MAMSTL>2.0.ZU;2-T
Abstract
We consider equations of the type L lozenge Y = R, X lozenge Y = R, X( lozenge n) = R, R lozenge X = L lozenge Y, where lozenge is a binary w ord (language) operation, L, R are given constant languages and X, Y a re the unknowns. We investigate the existence and uniqueness of maxima l and minimal solutions, properties of solutions, and the decidability of the existence of solutions. (C) 1996 Academic Press, Inc.