Browse wiki
From International Center for Computational Logic
Weighted automata can be seen as a natural … 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.hods for solving these problems optimally. +
11-02 +
@techreport{ BoPe-LTCS-11-02,
address = {Dresden, Germany},
author = {Stefan {Borgwardt} and Rafael {Pe{\~n}aloza}},
institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
number = {11-02},
title = {Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version},
type = {LTCS-Report},
year = {2011},
}
address = {Dresden, Germany},
author = {Stefan {Borgwardt} and Rafael {Pe{\~n}aloza}},
institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
number = {11-02},
title = {Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version},
type = {LTCS-Report},
year = {2011},
}
Borgwardt +
Stefan +
Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden +
Stefan Borgwardt, Rafael Peñaloza<br /& … Stefan Borgwardt, Rafael Peñaloza<br /> '''[[LATPub709|Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version]]''' <br />__NOTOC__Technical Report, ''Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden'', volume 11-02, 2011. ''LTCS-Report''<br/><span class="fas fa-chevron-right" style="font-size: 85%;" ></span> [[LATPub709|Details]] <span class="fas fa-chevron-right" style="font-size: 85%; margin-left: 2ex; "></span> [[Media:BoPe-LTCS-11-02.pdf|Download]]BoPe-LTCS-11-02.pdf|Download]] +
Stefan Borgwardt, Rafael Peñaloza<br /& … Stefan Borgwardt, Rafael Peñaloza<br /> '''[[LATPub709/en|Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version]]''' <br />__NOTOC__Technical Report, ''Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden'', volume 11-02, 2011. ''LTCS-Report''<br/><span class="fas fa-chevron-right" style="font-size: 85%;" ></span> [[LATPub709|Details]] <span class="fas fa-chevron-right" style="font-size: 85%; margin-left: 2ex;" ></span> [[Media:BoPe-LTCS-11-02.pdf|Download]]BoPe-LTCS-11-02.pdf|Download]] +
Display title of"Display title of" is a predefined property that can assign a distinct display title to an entity and is provided by <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a>.
Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version +
Modification date"Zuletzt geändert <span style="font-size:small;">(Modification date)</span>" is a predefined property that corresponds to the date of the last modification of a subject and is provided by <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a>.
25. März 2015, 14:34:10 +
Has query"Hat Abfrage <span style="font-size:small;">(Has query)</span>" is a predefined property that represents meta information (in form of a <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Subobject">subobject</a>) about individual queries and is provided by <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a>.
Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version +, Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version +, Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version +, Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version +, Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version + and Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version +
