Communication Dans Un Congrès Année : 2011

Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata

Résumé

We show that collapsible deterministic second level pushdown automata can recognize more languages than deterministic second level pushdown automata (without collapse). This implies that there exists a tree generated by a second level recursion scheme which is not generated by any second level safe recursion scheme.

Mots clés

Fichier principal
Vignette du fichier
55.pdf (212.69 Ko) Télécharger le fichier
Origine Accord explicite pour ce dépôt
Licence
Loading...

Dates et versions

hal-00573593 , version 1 (04-03-2011)

Licence

Identifiants

  • HAL Id : hal-00573593 , version 1

Citer

Pawel Parys. Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.603-614. ⟨hal-00573593⟩

Collections

76 Consultations
176 Téléchargements

Partager

  • More