Efficient Completion of Weighted Automata
We consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows updates of the graph: adding nodes and edges, and changing weights of existing edges. We apply this method in the construc...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2016-09-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1609.03645v1 |
| id |
doaj-1531f544b06b427cb009e547250f237a |
|---|---|
| record_format |
Article |
| spelling |
doaj-1531f544b06b427cb009e547250f237a2020-11-24T23:18:29ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802016-09-01225Proc. TERMGRAPH 2016556210.4204/EPTCS.225.8:7Efficient Completion of Weighted AutomataJohannes WaldmannWe consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows updates of the graph: adding nodes and edges, and changing weights of existing edges. We apply this method in the construction of matchbound certificates for automatically proving termination of string rewriting. We re-implement the decomposition/completion algorithm of Endrullis et al. (2006) in our framework, and achieve comparable performance.http://arxiv.org/pdf/1609.03645v1 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Johannes Waldmann |
| spellingShingle |
Johannes Waldmann Efficient Completion of Weighted Automata Electronic Proceedings in Theoretical Computer Science |
| author_facet |
Johannes Waldmann |
| author_sort |
Johannes Waldmann |
| title |
Efficient Completion of Weighted Automata |
| title_short |
Efficient Completion of Weighted Automata |
| title_full |
Efficient Completion of Weighted Automata |
| title_fullStr |
Efficient Completion of Weighted Automata |
| title_full_unstemmed |
Efficient Completion of Weighted Automata |
| title_sort |
efficient completion of weighted automata |
| publisher |
Open Publishing Association |
| series |
Electronic Proceedings in Theoretical Computer Science |
| issn |
2075-2180 |
| publishDate |
2016-09-01 |
| description |
We consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows updates of the graph: adding nodes and edges, and changing weights of existing edges.
We apply this method in the construction of matchbound certificates for automatically proving termination of string rewriting. We re-implement the decomposition/completion algorithm of Endrullis et al. (2006) in our framework, and achieve comparable performance. |
| url |
http://arxiv.org/pdf/1609.03645v1 |
| work_keys_str_mv |
AT johanneswaldmann efficientcompletionofweightedautomata |
| _version_ |
1725581324071206912 |