![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.246, Iss.1, 2000-09, pp. : 253-264
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Bilateral locally testable languages
By Garca P. Ruiz J. Vazquez de Parga M.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Families of locally testable languages
By Caron P.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Selmi C.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
An algebraic characterization of frontier testable tree languages
By Wilke T.
Theoretical Computer Science, Vol. 154, Iss. 1, 1996-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A proof of Simon's theorem on piecewise testable languages
By Higgins P.M.
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :