Author:
Barecka Agata,Charatonik Witold
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5), 231–240 (2005)
2. Barecka, A., Charatonik, W.: The parameterized complexity of chosen problems for finite automata on trees (2010), http://www.math.uni.wroc.pl/~barecka/papers/param_aut.pdf
3. Barguñó, 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), pp. 263–272. IEEE Computer Society Press, Edinburgh (2010)
4. Charatonik, W.: Automata on DAG representations of finite trees. Technical Report MPI-I-1999-2-001, Max-Planck-Institut für Informatik (1999)
5. Charatonik, W., Pacholski, L.: Set constraints with projections. Journal of the ACM 57(4), 1–37 (2010)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献