1 vote

NFA for a regular expression without $\epsilon$-transitions

You can convert the regular expression into an automaton using the Glushkov's construction. The resulting automaton is non-deterministic and does not contain any $\varepsilon$-transition. Its number ...
Nathaniel's user avatar
  • 15.6k

Only top scored, non community-wiki answers of a minimum length are eligible