Author:
Reuß Andreas,Seidl Helmut
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Barguño, L., Creus, C., Godoy, G., Jacquemard, F., Vacher, C.: The emptiness problem for tree automata with global constraints. In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), Edinburgh, Scotland, UK, July 2010. IEEE Computer Society Press, Los Alamitos (2010), http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCGJV-lics10.pdf (to appear)
2. Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: STACS 1992: Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, London, UK, pp. 161–171. Springer, Heidelberg (1992) ISBN 3-540-55210-3
3. Lecture Notes in Computer Science;A.-C. Caron,1994
4. Lecture Notes in Computer Science;A.-C. Caron,1993
5. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata (release October 12, 2007)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Searching entangled program spaces;Proceedings of the ACM on Programming Languages;2022-08-29
2. Finding Intruder Knowledge with Cap-Matching;Foundations of Security, Protocols, and Equational Reasoning;2019
3. Paths, tree homomorphisms and disequalities for -clauses;Mathematical Structures in Computer Science;2017-12-06
4. Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$ -Clauses;Implementation and Application of Automata;2012
5. Extending -clauses with disequalities;Information Processing Letters;2011-10