Pushdown Automata and Constant Height: Decidability and Bounds - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Pushdown Automata and Constant Height: Decidability and Bounds

Giovanni Pighizzini
Luca Prigioniero

Résumé

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.
Fichier principal
Vignette du fichier
480958_1_En_20_Chapter.pdf (292.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02387302 , version 1 (29-11-2019)

Licence

Paternité

Identifiants

Citer

Giovanni Pighizzini, Luca Prigioniero. Pushdown Automata and Constant Height: Decidability and Bounds. 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.260-271, ⟨10.1007/978-3-030-23247-4_20⟩. ⟨hal-02387302⟩
31 Consultations
31 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More