Weighted Automata with Storage

From International Center for Computational Logic
Revision as of 17:44, 19 April 2022 by Stephan Mennicke (talk | contribs) (Page created automatically by parser function on page Weighted Automata with Storage)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Weighted Automata with Storage

Talk by 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.