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

Author： Aceto L.   Fokkink W.   Ingolfsdottir A.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

Abstract

Related content

Nondeterministic regular expressions as solutions of equational systems

By De Nicola R.   Labella A.  

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 179-189

Elsevier

Access to resources Recommend Favorite

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

By Wu Chunhan   Zhang Xingyuan   Urban Christian  

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

Springer Publishing Company

Access to resources Recommend Favorite

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

Fast matching in combinations of regular equational theories

By Eker S.  

Electronic Notes in Theoretical Computer Science, Vol. 4, Iss. 1, 2004-01 ,pp. : 1-20

Elsevier

Access to resources Recommend Favorite

The multiplicative fragment of the Yanov equational theory

By Dolinka I.  

Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. : 417-425

Elsevier

Access to resources Recommend Favorite