![Complexity classes / Applied mathematics / Nondeterministic finite automaton / Deterministic finite automaton / Lookahead / PSPACE-complete / NP / Theoretical computer science / Automata theory / Models of computation Complexity classes / Applied mathematics / Nondeterministic finite automaton / Deterministic finite automaton / Lookahead / PSPACE-complete / NP / Theoretical computer science / Automata theory / Models of computation](https://www.pdfsearch.io/img/0b992093b3de751a0514a93811e49e4f.jpg) Date: 2014-02-07 10:22:52Complexity classes Applied mathematics Nondeterministic finite automaton Deterministic finite automaton Lookahead PSPACE-complete NP Theoretical computer science Automata theory Models of computation | | Decidability Results on the Existence of Lookahead Delegators for NFA Christof Löding and Stefan Repke Lehrstuhl für Informatik 7, RWTH Aachen, Aachen, Germany AbstractAdd to Reading ListSource URL: www.automata.rwth-aachen.deDownload Document from Source Website File Size: 534,10 KBShare Document on Facebook
|