Geodesic
A Type System Describing Unboundedness
Discrete mathematics & theoretical computer science, Tome 22 (2020-2021) no. 4

Voir la notice de l'article provenant de la source Episciences

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.
DOI : 10.23638/DMTCS-22-4-2
Classification : 03B40, 03D05, 68Q17, 68Q45 
@article{DMTCS_2020_22_4_a0,
     author = {Parys, Pawe{\l}},
     title = {A {Type} {System} {Describing} {Unboundedness}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {22},
     number = {4},
     year = {2020-2021},
     doi = {10.23638/DMTCS-22-4-2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-22-4-2/}
}
TY  - JOUR
AU  - Parys, Paweł
TI  - A Type System Describing Unboundedness
JO  - Discrete mathematics & theoretical computer science
PY  - 2020-2021
VL  - 22
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-22-4-2/
DO  - 10.23638/DMTCS-22-4-2
LA  - en
ID  - DMTCS_2020_22_4_a0
ER  - 
%0 Journal Article
%A Parys, Paweł
%T A Type System Describing Unboundedness
%J Discrete mathematics & theoretical computer science
%D 2020-2021
%V 22
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-22-4-2/
%R 10.23638/DMTCS-22-4-2
%G en
%F DMTCS_2020_22_4_a0
Parys, Paweł. A Type System Describing Unboundedness. Discrete mathematics & theoretical computer science, Tome 22 (2020-2021) no. 4. doi: 10.23638/DMTCS-22-4-2

Cité par Sources :