A Type System Describing Unboundedness

We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows to solve the simultaneous-unboundedness problem (SUP) for schemes, which asks, given a set of letters A and a scheme G, whether it is the case...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Mathematics and Theoretical Computer Science Jg. 22 no. 4; H. Automata, Logic and Semantics; S. 1 - 84
1. Verfasser: Parys, Paweł
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Nancy DMTCS 01.08.2020
Discrete Mathematics & Theoretical Computer Science
Schlagworte:
[info.info-cc]computer science [cs]/computational complexity [cs.cc]
[info.info-fl]computer science [cs]/formal languages and automata theory [cs.fl]
[info.info-lo]computer science [cs]/logic in computer science [cs.lo]
Computational Complexity
Computer Science
Finite sets
Formal Languages and Automata Theory
higher-order recursion schemes
intersection types
Logic in Computer Science
Mathematical research
Recursive functions
reflection
simultaneous-unboundedness problem
Trees (Graph theory)
Words (language)
Poland
intersection types
simultaneous-unboundedness problem
higher-order recursion schemes
reflection
ISSN:1365-8050, 1462-7264, 1365-8050
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows to solve the simultaneous-unboundedness problem (SUP) for schemes, which asks, given a set of letters A and a scheme G, whether it is 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. Using this type system we prove that SUP is (m-1)-EXPTIME-complete for word-recognizing schemes of order m, and m-EXPTIME-complete for tree-recognizing schemes of order m. Moreover, we establish the reflection property for SUP: out of an input scheme G one can create its enhanced version that recognizes the same language but is aware of the answer to SUP.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.23638/DMTCS-22-4-2