# FG1 Seminar talk

2019-01-18 (11:30-12:00)
Weighted $\omega$-pushdown automata
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 $\epsilon$-transitions. We show that they suffice to accept all ω-context-free languages. This enables us to use similar results developed for infinite nested words.