Author： Fraczak W. Podolak A.
Publisher： Elsevier
ISSN： 0020-0190
Source： Information Processing Letters, Vol.89, Iss.2, 2004-01, pp. : 65-70
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
Characterization and closure properties of linear -languages
By Mihoubi D.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :
Access to resources
Recommend
An algebraic characterization of frontier testable tree languages
By Wilke T.
Theoretical Computer Science, Vol. 154, Iss. 1, 1996-01 ,pp. :
LANGAGE: A maple package for automaton characterization of regular languages
By Caron P.
Theoretical Computer Science, Vol. 231, Iss. 1, 2000-01 ,pp. :
A characterization of recognizable picture languages by tilings by finite sets
By Simplot D.
Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. :