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

Author： Chang C.-H.   Paige R.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

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

Learning DFA from Simple Examples

By Parekh R.  

Machine Learning, Vol. 44, Iss. 1-2, 2001-07 ,pp. : 9-35

Springer Publishing Company

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

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

Partial derivatives of regular expressions and finite automaton constructions

By Antimirov V.  

Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,pp. : 291-319

Elsevier

Access to resources Recommend Favorite