%0 Conference Proceedings
%T Pushdown Automata and Constant Height: Decidability and Bounds
%+ Dipartimento di Informatica (ISLab)
%A Pighizzini, Giovanni
%A Prigioniero, Luca
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Košice, Slovakia
%Y Michal Hospodár
%Y Galina Jirásková
%Y Stavros Konstantinidis
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-11612
%P 260-271
%8 2019-07-17
%D 2019
%R 10.1007/978-3-030-23247-4_20
%Z Computer Science [cs]Conference papers
%X It cannot be decided whether a pushdown automaton accepts using constant pushdown height, with respect to the input length, or not. Furthermore, in the case of acceptance in constant height, the height cannot be bounded by any recursive function in the size of the description of the machine. In contrast, in the restricted case of pushdown automata over a one-letter input alphabet, i.e., unary pushdown automata, the above property becomes decidable. Moreover, if the height is bounded by a constant in the input length, then it is at most exponential with respect to the size of the description of the pushdown automaton. This bound cannot be reduced. Finally, if a unary pushdown automaton uses nonconstant height to accept, then the height should grow at least as the logarithm of the input length. This bound is optimal.
%G English
%Z TC 1
%Z WG 1.02
%2 https://inria.hal.science/hal-02387302/document
%2 https://inria.hal.science/hal-02387302/file/480958_1_En_20_Chapter.pdf
%L hal-02387302
%U https://inria.hal.science/hal-02387302
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-11612