On the closure of pattern expressions languages under intersection with regular languages

ISSN： 0001-5903

Source： Acta Informatica, Vol.46, Iss.3, 2009-05, pp. : 193-207

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

Regular binoid expressions and regular binoid languages

By Hashiguchi K. Wada Y. Jimbo S.

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 291-313

Elsevier

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

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

Regular component decomposition of regular languages

By Liu Y.J.

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 743-749

Elsevier

Access to resources Recommend Favorite

On the acceptance power of regular languages

By Borchert B.

Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. : 207-225

Elsevier

Access to resources Recommend Favorite