Back to Results
First PageMeta Content
Complexity 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 Abstract
Add to Reading List

Document Date: 2014-02-07 10:22:52

Open Document

File Size: 534,10 KB

Share Result on Facebook

City

Aachen / /

Company

Creative Commons / Dagstuhl Publishing / /

Country

Germany / /

IndustryTerm

e-services / fixed-point algorithm / polynomial time algorithm / /

Person

Anil Seth / Stefan Repke / Stefan Repke Lehrstuhl für Informatik / Christof Löding / Nisheeth K. Vishnoi / /

Position

winning player / wb / player / head / respective Player / /

ProvinceOrState

Georgia / /

PublishedMedium

Theoretical Computer Science / /

Technology

nondeterministic PSPACE algorithm / fixed-point algorithm / simulation / polynomial time algorithm / Digital Object Identifier / deterministic PSPACE algorithm / /

SocialTag