Title of article
A lower bound on the size of -free NFA corresponding to a regular expression
Author/Authors
Yuri Lifshits، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2003
Pages
7
From page
293
To page
299
Keywords
Combinatorial problems , Epsilon-free nondeterministic automata , Formal languages , regular expressions
Journal title
Information Processing Letters
Serial Year
2003
Journal title
Information Processing Letters
Record number
129673
Link To Document