Author： Francez N. Kaminski M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 155-175
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On algebraic and logical specifications of classes of regular languages
Theoretical Computer Science, Vol. 298, Iss. 2, 2003-04 ,pp. :
Access to resources
Recommend
LANGAGE: A maple package for automaton characterization of regular languages
By Caron P.
Theoretical Computer Science, Vol. 231, Iss. 1, 2000-01 ,pp. :
An algebraic characterization of frontier testable tree languages
By Wilke T.
Theoretical Computer Science, Vol. 154, Iss. 1, 1996-01 ,pp. :
Regular component decomposition of regular languages
By Liu Y.J.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
On the acceptance power of regular languages
By Borchert B.
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :