Two-way finite automaton: Difference between revisions

Content deleted Content added
State complexity tradeoffs: rm 1st redlink where article has been deleted per non-notability; adapt 2nd redlink's article title to wikipedia conventions
OAbot (talk | contribs)
m Open access bot: doi added to citation with #oabot.
Line 135:
| pages = 195–202
| doi = 10.1016/0022-0000(80)90034-3
| doi-access= free
}}</ref> constructed a sequence of languages, each accepted by an n-state NFA, yet which is not accepted by any sweeping automata with fewer than <math>2^n</math> states.