License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2017.45
URN: urn:nbn:de:0030-drops-83757
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8375/
Parys, Pawel
The Complexity of the Diagonal Problem for Recursion Schemes
Abstract
We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We establish the complexity of the diagonal problem for schemes: given a set of letters A and a scheme G, is it the case that for every number n the scheme accepts a word (a tree) in which every letter from A appears at least n times. We prove that this problem is (m-1)-EXPTIME-complete for word-recognizing schemes of order m, and m-EXPTIME-complete for tree-recognizing schemes of order m.
BibTeX - Entry
@InProceedings{parys:LIPIcs:2018:8375,
author = {Pawel Parys},
title = {{The Complexity of the Diagonal Problem for Recursion Schemes}},
booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-055-2},
ISSN = {1868-8969},
year = {2018},
volume = {93},
editor = {Satya Lokam and R. Ramanujam},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8375},
URN = {urn:nbn:de:0030-drops-83757},
doi = {10.4230/LIPIcs.FSTTCS.2017.45},
annote = {Keywords: diagonal problem, higher-order recursion schemes, intersection types, downward closure}
}
|
Keywords: |
|
diagonal problem, higher-order recursion schemes, intersection types, downward closure |
|
Collection: |
|
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
12.02.2018 |
