Author： Jirásková Galina
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.49, Iss.2, 2011-08, pp. : 306-318
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
Access to resources
Recommend
Odometers on Regular Languages
Theory of Computing Systems, Vol. 40, Iss. 1, 2007-02 ,pp. :
Boolean Algebras of Regular Languages
By Konovalov* A. Selivanov* ** V.
Algebra and Logic, Vol. 52, Iss. 6, 2014-01 ,pp. :
3.1. Sofic Subshifts and Regular Languages
Chaos and Complexity Letters, Vol. , Iss. , 2016-01 ,pp. :
On the weighted complexity of a regular covering of a graph
Journal of Combinatorial Theory, Series B, Vol. 89, Iss. 1, 2003-09 ,pp. :