Author： Antimirov V.M. Mosses P.D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.143, Iss.1, 1995-07, pp. : 51-72
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
Regular binoid expressions and regular binoid languages
By Hashiguchi K. Wada Y. Jimbo S.
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
Access to resources
Recommend
Synchronization expressions with extended join operation
By Salomaa K. Yu S.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
From regular expressions to DFA's using compressed NFA's
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :
Partial derivatives of regular expressions and finite automaton constructions
By Antimirov V.
Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,pp. :