Decidability Results on the Existence of Lookahead Delegators for NFA

DOI10.4230/LIPIcs.FSTTCS.2013.327zbMath1359.68173OpenAlexW2272792315MaRDI QIDQ2963924

Stefan Repke, Christof Löding

Publication date: 21 February 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2013.327

zbMATH Keywords

automatasafety gameslookahead delegators

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Unnamed Item ⋮ Width of Non-deterministic Automata ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Unnamed Item

This page was built for publication: Decidability Results on the Existence of Lookahead Delegators for NFA