Parameterized complexity of basic decision problems for tree automata-Reference-Cited by-同舟云学术

Parameterized complexity of basic decision problems for tree automata

Published:2013-06 Issue:6 Volume:90 Page:1150-1170
ISSN:0020-7160
Container-title:International Journal of Computer Mathematics
language:en
Short-container-title:International Journal of Computer Mathematics

Author:

Charatonik Witold,Chorowska Agata

Publisher

Informa UK Limited

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications

Link

http://www.tandfonline.com/doi/pdf/10.1080/00207160.2012.762451

Reference17 articles.

1. Closure properties and decision problems of dag automata

2. Barecka, A. and Charatonik, W. The parameterized complexity of chosen problems for finite automata on trees. Proceedings of the 5th International Conference on Language and Automata Theory and Applications (LATA’11), Tarragona. Edited by: Dediu, A. H., Inenaga, S. and Martín-Vide, C. pp.129–141. Berlin, Heidelberg: Springer. Lecture Notes in Computer Science, Vol. 6638

3. Barguñó, L., Creus, C., Godoy, G., Jacquemard, F. and Vacher, C. The emptiness problem for tree automata with global constraints. Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS’10), Edinburgh. Edited by: Jouannaud, J. P. July. pp.263–272. Washington: IEEE Computer Society Press.

4. Charatonik, W. 1999. “Automata on DAG representations of finite trees”. Saarbrucken: Max-Planck-Institut für Informatik. Tech. Rep. MPI-I-1999-2-001

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

1. Algebraic state space approach to model and control combined automata;Frontiers of Computer Science;2016-12-29

2. Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition;Frontiers of Computer Science;2014-09-03

3. Foreword;International Journal of Computer Mathematics;2013-06