Author： Maler O. Staiger L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.183, Iss.1, 1997-08, pp. : 93-112
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
Characterizations of rational -languages by means of right congruences
By Van D.L. Le Saec B. Litovsky I.
Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. :
Access to resources
Recommend
The syntactic monoid of hairpin-free languages
By Kari Lila Mahalingam Kalpana Thierrin Gabriel
Acta Informatica, Vol. 44, Iss. 3-4, 2007-07 ,pp. :
Explicit substitutions for pi-congruences
By Quaglia P.
Theoretical Computer Science, Vol. 269, Iss. 1, 2001-10 ,pp. :
On congruences of automata defined by directed graphs
By Kelarev A.V. Sokratova O.V.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Open maps, behavioural equivalences, and congruences
Theoretical Computer Science, Vol. 190, Iss. 1, 1998-01 ,pp. :