Author： Antimirov V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.155, Iss.2, 1996-03, pp. : 291-319
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
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Access to resources
Recommend
Rewriting extended regular expressions
Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. :
On finite automaton public-key cryptosystem
Theoretical Computer Science, Vol. 226, Iss. 1, 1999-09 ,pp. :
LANGAGE: A maple package for automaton characterization of regular languages
By Caron P.
Theoretical Computer Science, Vol. 231, Iss. 1, 2000-01 ,pp. :
Regular binoid expressions and regular binoid languages
By Hashiguchi K. Wada Y. Jimbo S.
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :