Author:
Bérard Béatrice,Picaronny Claudine
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. R. Alur and D.L. Dill. Automata for modeling real-time systems. In Proceedings of ICALP'90, number 443 in Lecture Notes in Computer Science, pages 322–335. Springer Verlag, 1990.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
3. N. Bedon. Automata, semi-groups and recognizability of words on ordinals. International Journal of Algebra and Computation. to appear.
4. N. Bedon. Finite automata and ordinals. Theoretical Computer Science, 156:119–144, 1996.
5. B. Bérard. Untiming timed languages. Information Processing Letters, 55:129–135, 1995.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS;International Journal of Foundations of Computer Science;2006-06
2. On Transfinite Hybrid Automata;Hybrid Systems: Computation and Control;2005
3. A Kleene Theorem for Languages of Words Indexed by Linear Orderings;Developments in Language Theory;2005
4. Reasoning About Transfinite Sequences;Automated Technology for Verification and Analysis;2005
5. Automata on Linear Orderings;Developments in Language Theory;2003