Author:
Fleischer Lukas,Kufleitner Manfred
Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference11 articles.
1. Becker, H.W., Riordan, J.: The arithmetic of Bell and Stirling numbers. Am. J. Math. 70(2), 385–394 (1948)
2. Berend, D., Tassa, T.: Improved bounds on Bell numbers and on moments of sums of random variables. Probab. Math. Stat. 30(2), 185–205 (2010)
3. Brandl, C.H., Simon, H.U.: Complexity analysis: Transformation monoids of finite automata. In: Potapov, I. (ed.) DLT 2015, Proceedings, volume 9168 of Lecture Notes in Computer Science, pages 143–154. Springer-Verlag (2015)
4. Carton, O., Michel, M.: Unambiguous Büchi automata. Theor. Comput. Sci. 297(1), 37–81 (2003)
5. Eilenberg, S.: Automata, Languages, and Machines, volume B. Academic Press, Cambridge (1976)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献