4 citations · 5 across the 6 of their papers we have counts for
1 paper · 2 filters
M. Utkan Gezer
Every language in NL has a k-head two-way nondeterministic finite automaton (2nfa(k)) recognizing it. It is known how to build a constant-space verifier algorithm from a 2nfa($…