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

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

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

Regular solutions of linear differential systems with power series coefficients

By Abramov S.   Khmelnov D.  

Programming and Computer Software, Vol. 40, Iss. 2, 2014-03 ,pp. : 98-106

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite