Weighted Automata with Storage

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Weighted Automata with Storage

Vortrag von Luisa Hermann
This talk is an excerpt of the PhD defense talk by Luisa Hermann. In this thesis, we investigate weighted tree automata with storage theoretically. This model generalises finite state automata in three dimensions: (i) from words to trees, (ii) by using an arbitrary storage type in addition to a finite-state control, and (iii) by considering languages in a quantitative setting using a weight structure.