1
vote
How can we construct a NFA that accepts the substring matches
You could first build a sequential automaton that outputs the "substring matches". Here is an example for the word $aba$. The vertical bars are just separators between the input (in red) and ...
- 41.4k
Only top scored, non community-wiki answers of a minimum length are eligible