A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions

Author： Wu Chunhan   Zhang Xingyuan   Urban Christian  

Publisher： Springer Publishing Company

ISSN： 0168-7433

Source： Journal of Automated Reasoning, Vol.52, Iss.4, 2014-04, pp. : 451-480

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Rewriting extended regular expressions

By Antimirov V.M.   Mosses P.D.  

Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. : 51-72

Elsevier

Access to resources Recommend Favorite

Regular binoid expressions and regular binoid languages

By Hashiguchi K.   Wada Y.   Jimbo S.  

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 291-313

Elsevier

Access to resources Recommend Favorite

On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based

By Aceto L.   Fokkink W.   Ingolfsdottir A.  

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 163-178

Elsevier

Access to resources Recommend Favorite

From regular expressions to DFA's using compressed NFA's

By Chang C.-H.   Paige R.  

Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. : 1-36

Elsevier

Access to resources Recommend Favorite

An Inheritance System with Regular Expressions and IS-A Relation

By Tsukamoto M.   Nishio S.  

Journal of Systems Integration, Vol. 7, Iss. 3-4, 1997-09 ,pp. : 349-379

Springer Publishing Company

Access to resources Recommend Favorite