Non-Self-Embedding Grammars, Constant Height Pushdown Automata, and Limited Automata - Archive ouverte HAL
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2020

Non-Self-Embedding Grammars, Constant Height Pushdown Automata, and Limited Automata

Résumé

Non-self-embedding grammars are a restriction of contextfree grammars which does not allow to describe recursive structures and, hence, which characterizes only the class of regular languages. A double exponential gap in size between non-self-embedding grammars and deterministic finite automata is known. The same size gap is also known from constant height pushdown automata and 1-limited automata to equivalent deterministic finite automata. Constant height pushdown automata and 1-limited automata are compared with non-self-embedding grammars. It is proved that non-self-embedding grammars and constant height pushdown automata are polynomially related in size. However, they can be exponentially larger than 1-limited automata.
Fichier principal
Vignette du fichier
nse-pda.pdf (578.46 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04093781 , version 1 (10-05-2023)

Licence

Identifiants

Citer

Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero. Non-Self-Embedding Grammars, Constant Height Pushdown Automata, and Limited Automata. International Journal of Foundations of Computer Science, 2020, 31 (08), pp.1133-1157. ⟨10.1142/S0129054120420071⟩. ⟨hal-04093781⟩
12 Consultations
31 Téléchargements

Altmetric

Partager

More