Author:
Colcombet Thomas,Daviaud Laure
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference12 articles.
1. Bojańczyk, M., Colcombet, T.: Bounds in ω-regularity. In: LICS 06, pp. 285–296 (2006)
2. Colcombet, T.: The theory of stabilisation monoids and regular cost functions. In: ICALP 2009 (2): Automata, Languages and Programming, 36th International Colloquium, vol. 5556, pp. 139–150. Springer, Berlin (2009)
3. Colcombet, T.: Green’s relations and their use in automata theory. In: Dediu, A.H., Inenaga, S., Martín-Vide, C. (eds.) : LATA, volume 6638 of Lecture Notes in Computer Science, pp. 1–21. Springer (2011). Invited lecture
4. Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. J. Comput. Syst. Sci. 24(2), 233–244 (1982)
5. Kirsten, D.: Distance desert automata and the star height problem. RAIRO 3(39), 455–509 (2005)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献