Complexity of controlled bad sequences over finite sets of $\mathbb{N}^d$
Logic in Computer Science
2020-06-09 v5 Computational Complexity
Abstract
We provide upper and lower bounds for the length of controlled bad sequences over the majoring and the minoring orderings of finite sets of . The results are obtained by bounding the length of such sequences by functions from the Cichon hierarchy. This allows us to translate these results to bounds over the fast-growing complexity classes. The obtained bounds are proven to be tight for the majoring ordering, which solves a problem left open by Abriola, Figueira and Senno (Theor. Comp. Sci, Vol. 603). Finally, we use the results on controlled bad sequences to prove upper bounds for the emptiness problem of some classes of automata.
Keywords
Cite
@article{arxiv.1909.01667,
title = {Complexity of controlled bad sequences over finite sets of $\mathbb{N}^d$},
author = {A. R. Balasubramanian},
journal= {arXiv preprint arXiv:1909.01667},
year = {2020}
}