Logic for ω-Pushdown Automata - Archive ouverte HAL
Article Dans Une Revue Information and Computation Année : 2022

Logic for ω-Pushdown Automata

Résumé

Context-free languages of infinite words have recently found increasing interest. Here, we will present a second-order logic with the same expressive power as Büchi or Muller pushdown automata for infinite words. This extends fundamental logical characterizations of Büchi, Elgot, Trakhtenbrot for regular languages of finite and infinite words and a more recent logical characterization of Lautemann, Schwentick and Thérien for context-free languages of finite words to ω-context-free languages. For our argument, we will investigate Greibach normal forms of ω-context-free grammars as well as a new type of Büchi pushdown automata which can alter their stack by at most one element and without ε-transitions. We show that they suffice to accept all ω-context-free languages. This enables us to use similar results recently developed for infinite nested words.
Fichier principal
Vignette du fichier
droste_dziadek_kuich-logic_for_omega_pushdown_automata.pdf (317.9 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04732028 , version 1 (11-10-2024)

Licence

Identifiants

Citer

Manfred Droste, Sven Dziadek, Werner Kuich. Logic for ω-Pushdown Automata. Information and Computation, 2022, 282, pp.104659. ⟨10.1016/j.ic.2020.104659⟩. ⟨hal-04732028⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More