Author： Berthé Valérie
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.40, Iss.1, 2007-02, pp. : 1-31
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
Boolean Algebras of Regular Languages
By Konovalov* A. Selivanov* ** V.
Algebra and Logic, Vol. 52, Iss. 6, 2014-01 ,pp. :
Access to resources
Recommend
3.1. Sofic Subshifts and Regular Languages
Chaos and Complexity Letters, Vol. , Iss. , 2016-01 ,pp. :
Query Learning of Regular Tree Languages: How to Avoid Dead States
By Drewes Frank
Theory of Computing Systems, Vol. 40, Iss. 2, 2007-02 ,pp. :