On the closure properties of linear conjunctive languages

Author： Okhotin A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 663-685

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Characterization and closure properties of linear -languages

By Mihoubi D.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 79-95

Elsevier

Access to resources Recommend Favorite

The Boolean closure of linear context-free languages

By Kutrib Martin  

Acta Informatica, Vol. 45, Iss. 3, 2008-05 ,pp. : 177-191

Springer Publishing Company

Access to resources Recommend Favorite

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems

By Fernau Henning   Kuppusamy Lakshmanan   Raman Indhumathi  

RAIRO - Theoretical Informatics and Applications, Vol. 52, Iss. 1, 2018-07 ,pp. : 1-21

Edp Sciences

Access to resources Recommend Favorite

An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages

By Peled D.   Wilke T.   Wolper P.  

Theoretical Computer Science, Vol. 195, Iss. 2, 1998-03 ,pp. : 183-203

Elsevier

Access to resources Recommend Favorite

Insertion and deletion closure of languages

By Ito M.   Kari L.   Thierrin G.  

Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. : 3-19

Elsevier

Access to resources Recommend Favorite