Loris D'Antoni
Margus Veanes
ABSTRACT
Symbolic tree automata allow transitions to carry predicates over rich alphabet theories, such as linear arithmetic, and therefore extend finite tree automata to operate over infinite alphabets, such as the set of rational numbers. Existing tree automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In this paper we study the problem of minimizing symbolic tree automata. First, we formally define and prove the properties of minimality in the symbolic setting. Second, we lift existing minimization algorithms to symbolic tree automata. Third, we present a new algorithm based on the following idea: the problem of minimizing symbolic tree automata can be reduced to the problem of minimizing symbolic (string) automata by encoding the tree structure as part of the alphabet theory. We implement and evaluate all our algorithms against existing implementations and show that the symbolic algorithms scale to large alphabets and can minimize automata over complex alphabet theories.
- P. Abdulla, J. Deneux, L. Kaati, and M. Nilsson. Minimization of non-deterministic automata with large alphabets. In CIAA, volume 3845 of LNCS, pages 31--42. Springer, 2006. Google Scholar
Digital Library
- P. Abdulla, A. Bouajjani, L. Holík, L. Kaati, and T. Vojnar. Composed bisimulation for tree automata. In CIAA, volume 5148 of LNCS, pages 212--222. Springer, 2008. Google ScholarDigital Library
- R. Almeida, L. Holík, and R. Mayr. Minimization of nondeterministic tree automata. TACAS, 2016. Google ScholarDigital Library
- R. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic decision diagrams and their applications. In Computer-Aided Design, 1993. ICCAD-93. Digest of Technical Papers., 1993 IEEE/ACM International Conference on, pages 188--191, Nov 1993. Google ScholarDigital Library
- W. S. Brainerd. The minimalization of tree automata. Information and Control, 13(5):484--491, 1968.Google ScholarCross Ref
- R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677--691, 1986. Google ScholarDigital Library
- J. A. Brzozowski. Canonical regular expressions and minimal state graphs for definite events. In Proc. Sympos. Math. Theory of Automata, pages 529--561, New York, 1963.Google Scholar
- R. C. Carrasco, J. Daciuk, and M. L. Forcada. An implementation of deterministic tree automata minimization. In CIAA'07, volume 4783 of LNCS, pages 122--129. Springer, 2007. Google ScholarDigital Library
- C. C. Chang and H. J. Keisler. Model Theory, volume 73 of Studies in Logic and the Foundation of Mathematics. North Holland, third edition, 1990.Google Scholar
- E. Clarke, M. Fujita, P. McGeer, K. McMillan, and J. Yang. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. In IWLS93: International Workshop on Logic Synthesis, pages 6a:1--15, Lake Tahoe, CA, May 1993.Google Scholar
- P. Claves, D. Jansen, S. J. Holtrup, M. Mohr, A. Reis, M. Schatz, and I. Thesing. Lethal: Little Extensible Tree and Hedge Automaton Library. http://lethal.sourceforge.net/.Google Scholar
- L. Cleophas, D. G. Kourie, T. Strauss, and B. W. Watson. On minimizing deterministic tree automata. In J. Holub and J. Žďárek, editors, PSC '09, pages 173--182, 2009.Google Scholar
- H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications, 2007.Google Scholar
- L. D'Antoni and M. Veanes. Minimization of symbolic automata. POPL'14, pages 541--553, New York, NY, USA, 2014. ACM. Google ScholarDigital Library
- L. D'Antoni and M. Veanes. Extended symbolic finite automata and transducers. Formal Methods in System Design, 47(1):93--119, Aug. 2015. Google ScholarDigital Library
- L. D'Antoni, M. Veanes, B. Livshits, and D. Molnar. Fast: A transducer-based language for tree manipulation. TOPLAS, 38(1):1--32, Oct. 2015. Google ScholarDigital Library
- L. de Moura and N. Bjørner. Z3: An Efficient SMT Solver. In TACAS'08, LNCS. Springer, 2008. Google ScholarDigital Library
- L. de Moura and N. Bjørner. Satisfiability modulo theories: Introduction and applications. Comm. ACM, 54(9):69--77, 2011. Google ScholarDigital Library
- F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.Google Scholar
- T. Genet and V. V. T. Tong. Timbuk: A Tree Automata Library. http://www.irisa.fr/celtique/genet/timbuk/.Google Scholar
- J. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In TACAS '95, volume 1019. Springer, 1995. Google ScholarDigital Library
- J. Högberg, A. Maletti, and J. May. Backward and forward bisimulation minimisation of tree automata. In CIAA, volume 4783 of LNCS, pages 109--121. Springer, 2007. Google ScholarDigital Library
- J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 1979.Google ScholarDigital Library
- H. Hosoya and B. C. Pierce. XDuce: A statically typed XML processing language. ACM Trans. Internet Technol., 3(2):117--148, May 2003. Google ScholarDigital Library
- D. Huffman. The synthesis of sequential switching circuits. Journal of the Franklin Institute, 257(3-4): 161--190,275--303, 1954.Google ScholarCross Ref
- O. Lengal, J. Šimáček, and T. Vojnar. Vata: A library for efficient manipulation of non-deterministic tree automata. TACAS'12, 7214: 79--94, 2012. Google ScholarDigital Library
- J. May and K. Knight. A primer on tree automata software for natural language processing, 2008.Google Scholar
- E. F. Moore. Gedanken-experiments on sequential machines. Automata studies, Annals of mathematics studies, (34):129--153, 1956.Google Scholar
- R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973--989, 1987. Google ScholarDigital Library
- A. Valmari. Fast brief practical DFA minimization. Information Processing Letters, 112:213--217, 2012. Google ScholarDigital Library
- G. van Noord and D. Gerdemann. Finite state transducers with predicates and identities. Grammars, 4(3):263--286, 2001.Google ScholarCross Ref
- M. Veanes and N. Bjørner. Symbolic tree automata. Information Processing Letters, 115(3):418--424, 2015.Google ScholarCross Ref
- M. Veanes, P. Hooimeijer, B. Livshits, D. Molnar, and N. Bjørner. Symbolic finite state transducers: Algorithms and applications. In POPL'12, pages 137--150, 2012. Google ScholarDigital Library
Index Terms
- Minimization of Symbolic Tree Automata
Recommendations
Minimization of symbolic automata
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesSymbolic Automata extend classical automata by using symbolic alphabets instead of finite ones. Most of the classical automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In this ...
Minimization of symbolic automata
POPL '14Symbolic Automata extend classical automata by using symbolic alphabets instead of finite ones. Most of the classical automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In this ...
From Tree Automata to String Automata Minimization
In this paper, we propose a reduction of the minimization problem for a bottom-up deterministic tree automaton (DFTA), making the latter a minimization of a string deterministic finite automaton (DFA). To achieve this purpose, we proceed first by the ...
Comments