Author:
Kiefer Stefan,Murawski Andrzej S.,Ouaknine Joël,Wachter Björn,Worrell James
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Baier, C., Bertrand, N., Größer, M.: Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems. In: DCFS. EPTCS, vol. 3, pp. 3–16 (2009)
2. Blondel, V.D., Canterini, V.: Undecidable problems for probabilistic automata of fixed dimension. Theoretical Computer Science 36(3), 231–245 (2003)
3. Blum, M., Chandra, A., Wegman, M.: Equivalence of free boolean graphs can be decided probabilistically in polynomial time. Inf. Process. Lett. 10(2), 80–82 (1980)
4. Lecture Notes in Computer Science;K. Chatterjee,2009
5. Lecture Notes in Computer Science;L. Christoff,1992
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献