Computing<i>ϵ</i>-Free NFA from Regular Expressions in<i>O</i>(<i>n</i>log<sup>2</sup>(<i>n</i>)) Time (Q4761388)
From MaRDI portal
scientific article; zbMATH DE number 1563297
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing<i>ϵ</i>-Free NFA from Regular Expressions in<i>O</i>(<i>n</i>log<sup>2</sup>(<i>n</i>)) Time |
scientific article; zbMATH DE number 1563297 |
Statements
Computing<i>ϵ</i>-Free NFA from Regular Expressions in<i>O</i>(<i>n</i>log<sup>2</sup>(<i>n</i>)) Time (English)
0 references
11 February 2001
0 references
nondeterministic finite automaton
0 references
