Author:
Bruyère Véronique,Carton Olivier
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference25 articles.
1. E. Asarin, P. Caspi, O. Maler, A Kleene theorem for timed automata, in: Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997, pp. 160–171
2. An Eilenberg theorem for words on countable ordinals;Bedon,1998
3. Accepting Zeno words without making time stand still;Bérard,1997
4. A Kleene theorem for languages of words indexed by linear orderings;Bès,2005
5. Automata on linear orderings;Bruyère,2001
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献