Composed Bisimulation for Tree Automata-Reference-Cited by-同舟云学术

Composed Bisimulation for Tree Automata

Published: Issue: Volume: Page:212-222
ISSN:0302-9743
Container-title:Implementation and Applications of Automata
language:
Short-container-title:

Author:

Abdulla Parosh A.,Bouajjani Ahmed,Holík Lukáš,Kaati Lisa,Vojnar Tomáš

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70844-5_22.pdf

Reference14 articles.

1. Abdulla, P., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Composed Bisimulation for Tree Automata. Technical Report FIT-TR-2008-04, FIT, Brno Uni. of Technology, Czech Republic (2008)

2. Lecture Notes in Computer Science;P. Abdulla,2008

3. Lecture Notes in Computer Science;P. Abdulla,2006

4. Abdulla, P., Holík, L., Kaati, L., Vojnar, T.: A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Technical Report FIT-TR-2008-05, FIT, Brno Uni. of Technology, Czech Republic (2008)

5. Lecture Notes in Computer Science;P. Abdulla,2002

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Program synthesis using abstraction refinement;Proceedings of the ACM on Programming Languages;2018-01

2. Synthesis of data completion scripts using finite tree automata;Proceedings of the ACM on Programming Languages;2017-10-12

3. Minimization of Symbolic Transducers;Computer Aided Verification;2017

4. Minimization of Symbolic Tree Automata;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

5. Detecting Social Positions Using Simulation;2010 International Conference on Advances in Social Networks Analysis and Mining;2010-08