Geodesic
On language equations with concatenation and various sets of Boolean operations
Okhotin, Alexander1
1 Department of Mathematics and Statistics, University of Turku, 20014 Turku, Finland.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 49 (2015) no. 3, pp. 205-232

Voir la notice de l'article provenant de la source Numdam

Systems of equations of the form X i =ϕ i (X 1 ,...,X n ), for 1 ⩽ i ⩽ n , in which the unknowns X i are formal languages, and the right-hand sides ϕ i may contain concatenation and union, are known for representing context-free grammars. If, instead of union only, another set of Boolean operations is used, the expressive power of such equations may change: for example, using both union and intersection leads to conjunctive grammars [A. Okhotin, J. Automata, Languages and Combinatorics 6 (2001) 519–535], whereas using all Boolean operations allows all recursive sets to be expressed by unique solutions [A. Okhotin, Decision problems for language equations with Boolean operations, Automata, Languages and Programming, ICALP 2003, Eindhoven, The Netherlands, 239–251]. This paper investigates the expressive power of such equations with any possible set of Boolean operations. It is determined that different sets of Boolean operations give rise to exactly seven families of formal languages: the recursive languages, the conjunctive languages, the context-free languages, a certain family incomparable with the context-free languages, as well as three subregular families.

Reçu le :
Accepté le :
DOI : 10.1051/ita/2015006
Classification : 68Q45, 06E30, 68R99
Keywords: Language equations, Boolean operations, Post’s lattice

Okhotin, Alexander 1

1 Department of Mathematics and Statistics, University of Turku, 20014 Turku, Finland. 
@article{ITA_2015__49_3_205_0,
     author = {Okhotin, Alexander},
     title = {On language equations with concatenation and various sets of {Boolean} operations},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {205--232},
     publisher = {EDP-Sciences},
     volume = {49},
     number = {3},
     year = {2015},
     doi = {10.1051/ita/2015006},
     mrnumber = {3434599},
     zbl = {1347.68209},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2015006/}
}
TY  - JOUR
AU  - Okhotin, Alexander
TI  - On language equations with concatenation and various sets of Boolean operations
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2015
SP  - 205
EP  - 232
VL  - 49
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita/2015006/
DO  - 10.1051/ita/2015006
LA  - en
ID  - ITA_2015__49_3_205_0
ER  - 
%0 Journal Article
%A Okhotin, Alexander
%T On language equations with concatenation and various sets of Boolean operations
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2015
%P 205-232
%V 49
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita/2015006/
%R 10.1051/ita/2015006
%G en
%F ITA_2015__49_3_205_0
Okhotin, Alexander. On language equations with concatenation and various sets of Boolean operations. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 49 (2015) no. 3, pp. 205-232. doi: 10.1051/ita/2015006

Cité par Sources :