- Titel
- Complementation and Inclusion of Weighted Automata on Infinite Trees
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-795208
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 10-05
- Erstveröffentlichung
- 2010
- DOI
- https://doi.org/10.25368/2022.178
- Abstract (EN)
- Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. In this report we study the problems of intersection, complementation and inclusion for weighted automata on infinite trees and show that they are not harder than reasoning with unweighted automata. We also present explicit methods for solving these problems optimally.
- Freie Schlagwörter (DE)
- Beschreibungslogik, gewichteter Automat, algebraisch
- Freie Schlagwörter (EN)
- description logic, weighted automaton, algebraic
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Technische Universität Dresden, Dresden
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-795208
- Veröffentlichungsdatum Qucosa
- 16.06.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0