Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati & Tomás Vojnar (2008):
Computing Simulations over Tree Automata.
In: TACAS,
LNCS 4963,
pp. 93–108.
Available at http://dx.doi.org/10.1007/978-3-540-78800-3_8.
Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati & Tomás Vojnar (2009):
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata.
Electr. Notes Theor. Comput. Sci. 251,
pp. 27–48.
Available at http://dx.doi.org/10.1016/j.entcs.2009.08.026.
Parosh Aziz Abdulla, Axel Legay, Julien d'Orso & Ahmed Rezine (2006):
Tree Regular Model Checking: A Simulation-Based Approach.
J. Log. Algebr. Program. 69(1-2),
pp. 93–121.
Available at http://dx.doi.org/10.1016/j.jlap.2006.02.001.
T. Genet et al. (2015):
Timbuk.
http://www.irisa.fr/celtique/genet/timbuk/.
R. Almeida (2016):
minotaut.
https://github.com/ric-almeida/heavy-minotaut.
Ricardo Almeida, Lukáš Holík & Richard Mayr (2016):
Reduction of Nondeterministic Tree Automata,
pp. 717–735.
Springer Berlin Heidelberg,
Berlin, Heidelberg.
Available at http://dx.doi.org/10.1007/978-3-662-49674-9_46.
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz & Tomás Vojnar (2006):
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures.
In: SAS,
LNCS 4134,
pp. 52–70.
Available at http://dx.doi.org/10.1007/11823230_5.
Lorenzo Clemente & Richard Mayr (2013):
Advanced automata minimization.
In: Roberto Giacobazzi & Radhia Cousot: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '13, Rome, Italy - January 23 - 25, 2013.
ACM,
pp. 63–74.
Available at http://doi.acm.org/10.1145/2429069.2429079.
Lorenzo Clemente & Richard Mayr (2016):
Efficient Reduction of Nondeterministic Automata with Application to Language Inclusion Testing.
Submitted to LMCS.
H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison & M. Tommasi (2008):
Tree Automata Techniques and Applications.
Available on: http://www.grappa.univ-lille3.fr/tata.
Release November, 18th 2008.
I. Durand (2015):
Autowrite.
http://dept-info.labri.fr/~idurand/autowrite.
Kousha Etessami (2002):
A Hierarchy of Polynomial-Time Computable Simulations for Automata.
In: CONCUR,
LNCS 2421,
pp. 131–144.
Available at http://dx.doi.org/10.1007/3-540-45694-5_10.
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, JiríSimácek & Tomás Vojnar (2013):
Fully Automated Shape Analysis Based on Forest Automata.
In: CAV,
LNCS 8044,
pp. 740–755.
Available at http://dx.doi.org/10.1007/978-3-642-39799-8_52.
Haruo Hosoya (2010):
Foundations of XML Processing: The Tree-Automata Approach,
1st edition.
Cambridge University Press,
New York, NY, USA.
Available at http://dx.doi.org/10.1017/CBO9780511762093.
Ondrej Lengál, JiríSimácek & Tomás Vojnar (2015):
Libvata: highly optimised non-deterministic finite tree automata library.
http://www.fit.vutbr.cz/research/groups/verifit/tools/libvata/.
Ondrej Lengál, JiríSimácek, Tomás Vojnar, Peter Habermehl, Lukás Holík & Adam Rogalewicz (2015):
Forester: tool for verification of programs with pointers.
http://www.fit.vutbr.cz/research/groups/verifit/tools/forester/.
Deian Tabakov & Moshe Y. Vardi (2007):
Model Checking Buechi Specifications.
In: Remco Loos, Szilárd Zsolt Fazekas & Carlos Martín-Vide: LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications. Report 35/07.
Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona,
pp. 565–576.
eptcs@eptcs.org