Weighted Automata with Storage

From International Center for Computational Logic
Toggle side column

Weighted Automata with Storage

Luisa HerrmannLuisa Herrmann
Luisa Herrmann
Weighted Automata with Storage
Phd thesis, Technische Universität Dresden, 2020/09/29
  • KurzfassungAbstract
    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.
  • Weitere Informationen unter:Further Information: Link
  • Forschungsgruppe:Research Group: Computational LogicComputational Logic
@phdthesis{H2020,
  author = {Luisa Herrmann},
  title  = {Weighted Automata with Storage},
  school = {Technische Universit{\"{a}}t Dresden},
  year   = {2020}
}