# Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata

@article{Droste2019GreibachNF, title={Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata}, author={Manfred Droste and Sven Dziadek and Werner Kuich}, journal={Inf. Comput.}, year={2019}, volume={285}, pages={104871} }

## One Citation

Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite Words

- Computer ScienceFSTTCS
- 2020

A weighted logic with the same expressive power as the new automaton model, weighted ω-pushdown automata, and a result of expressive equivalence of Muller and Büchi acceptance are proved.

## References

SHOWING 1-10 OF 31 REFERENCES

Handbook of Weighted Automata

- Computer Science
- 2009

This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications, and presents a detailed survey of the state of the art and pointers to future research.

A Logical Characterization of Timed Pushdown Languages

- Computer ScienceCSR
- 2015

A quantitative logic on timed words which is expressively equivalent to timed pushdown automata is introduced, an extension of Wilke’s relative distance logic by quantitative matchings.

Logics for Weighted Timed Pushdown Automata

- Computer ScienceFields of Logic and Computation II
- 2015

A decomposition theorem is proved which establishes a connection between weighted timed push down languages and visibly pushdown languages of Alur and Mudhusudan and introduces a weighted MSO logic on timed words which is expressively equivalent to weighted timing pushdown automata.

A Kleene Theorem for Weighted ω-Pushdown Automata

- Computer ScienceActa Cybern.
- 2017

The main result in the proof of the Kleene Theorem is the construction of a weighted ω-pushdown automaton for the ω -algebraic closure of subsets of a continuous star-omega semiring.

A Note on Nested Words

- Computer Science
- 2006

For every regular language of nested words, the underlying strings form a context-free language, and every context-free language can be obtained in this way. Nested words and nested-word automata are…

The Triple-Pair Construction for Weighted ω-Pushdown Automata

- MathematicsAFL
- 2017

The construction of the mixed context-free grammar from P is a generalization of the well known triple construction and is called now triple-pair construction for omega-pushdown automata.

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

- Computer ScienceJACM
- 1965

It is given that every context-free phrase structure generator is strongly equivalent to one in standard form and offers an independent proo[' of a variant of the Chomsky-Setditzenberger 1tortoni form theorem.