Publisher
Springer International Publishing
Reference21 articles.
1. Arnold, A.: Rational $$\omega $$ -languages are non-ambiguous. Theor. Comput. Sci. 26, 221–223 (1983)
2. Baier, C., Kiefer, S., Klein, J., Klüppelholz, S., Müller, D., Worrell, J.: Markov chains and unambiguous Büchi automata. In: CAV, pp. 23–42 (2016)
3. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: CLMPS 1960, pp. 1–11. Stanford University Press (1962)
4. Lecture Notes in Computer Science;T Colcombet,2015
5. Friedgut, E., Kupferman, O., Vardi, M.Y.: Büchi complementation made tighter. Int. J. Found. Comput. Sci. 17(4), 851–868 (2006)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献