Title of article :
A lower bound on the size of -free NFA corresponding to a regular expression
Author/Authors :
Yuri Lifshits، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2003
Keywords :
Combinatorial problems , Epsilon-free nondeterministic automata , Formal languages , regular expressions
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
