- AutorIn
- Erik Paul
- Titel
- Weighted tree automata and quantitative logics with a focus on ambiguity
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:15-qucosa2-164548
- Schriftenreihe
- Abschluss- und Qualifikationsarbeiten aus der Fakultät für Mathematik und Informatik
- Datum der Einreichung
- 01.04.2015
- Abstract (EN)
- We relate various restrictions of a quantitative logic to subclasses of weighted tree automata. The subclasses are defined by the level of ambiguity allowed in the automata. This yields a generalization of the results by Stephan Kreutzer and Cristian Riveros, who considered the same problem for weighted automata over words. Along the way we also prove that a finitely ambiguous weighted tree automaton can be decomposed into unambiguous ones and define and analyze polynomial ambiguity for tree automata.
- Freie Schlagwörter (DE)
- ambiguity, quantitative logic, tree automata, weighted logic
- Klassifikation (DDC)
- 000
- BetreuerIn Hochschule / Universität
- Prof. Dr. Manfred Droste
- Den akademischen Grad verleihende / prüfende Institution
- Universität Leipzig, Leipzig
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:15-qucosa2-164548
- Veröffentlichungsdatum Qucosa
- 20.10.2017
- Dokumenttyp
- Diplomarbeit
- Sprache des Dokumentes
- Englisch