Searching for "Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
by Juraj Hromkovic, Sebastian Seibert, Thomas Wilke — 1997 — In STACS 97, Lecture Notes in Computer Science
…: Berlin, 1997, pp. 55--66. Translating Regular Expressions into Small "-Free Nondeterministic Finite…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB