Abstract
We introduce saturation of nondeterministic tree automata, a technique that consists of adding new transitions to an automaton while preserving its language. We implemented our algorithm on minotaut - a module of the tree automata library libvata that reduces the size of automata by merging states and removing superfluous transitions - and we show how saturation can make subsequent merge and transition-removal operations more effective. Thus we obtain a Ptime algorithm that reduces the size of tree automata even more than before. Additionally, we explore how minotaut alone can play an important role when performing hard operations like complementation, allowing to both obtain smaller complement automata and lower computation times. We then show how saturation can extend this contribution even further. We tested our algorithms on a large collection of automata from applications of libvata in shape analysis, and on different classes of randomly generated automata.
Original language | English |
---|---|
Title of host publication | 1th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, rm Telč, Czech Republic, 21st-23rd October 2016 |
Editors | Jan Bouda, Lukáš Holík, Jan Kofroň, Jan Strejček, Adam Rambousek |
Publisher | Open Publishing Association |
Pages | 33-51 |
Number of pages | 19 |
Volume | 233 |
DOIs | |
Publication status | Published - 13 Dec 2016 |
Event | 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science - Telč, Czech Republic Duration: 21 Oct 2016 → 23 Oct 2016 Conference number: 11 |
Publication series
Name | Electronic Proceedings in Theoretical Computer Science |
---|---|
Publisher | Open Publishing Association |
ISSN (Electronic) | 2075-2180 |
Conference
Conference | 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science |
---|---|
Abbreviated title | MEMICS 2016 |
Country/Territory | Czech Republic |
City | Telč |
Period | 21/10/16 → 23/10/16 |