, A Kleene theorem for timed automata, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.160-171, 1997.
DOI : 10.1109/LICS.1997.614944
, Accepting Zeno words without making time stand still, In Mathematical Foundations of Computer Science Lect. Notes in Comput. Sci, vol.1295, pp.149-158, 1997.
DOI : 10.1007/BFb0029958
, Automata on Linear Orderings, Lect. Notes in Comput. Sci, vol.2136, pp.236-247, 2001.
DOI : 10.1007/3-540-44683-4_21
, Hierarchy among automata on linear orderings, Foundation of Information technology in the era of network and mobile computing, pp.107-118, 2002.
, Automata on linear orderings, 2000.
, Weak Second-Order Arithmetic and Finite Automata, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.9, issue.1-6, pp.66-92, 1960.
DOI : 10.1002/malq.19600060105
, On a Decision Method in Restricted Second Order Arithmetic, Proc. Int. Congress Logic, pp.1-11, 1960.
DOI : 10.1007/978-1-4613-8928-6_23
, Transfinite Automata Recursions and Weak Second Order Theory of Ordinals, Proc. Int. Congress Logic, Methodology, and Philosophy of Science, pp.2-23, 1964.
DOI : 10.1007/978-1-4613-8928-6_24
, Accessibility in Automata on Scattered Linear Orderings, Lect. Notes in Comput. Sci, vol.2420, pp.155-164, 2002.
DOI : 10.1007/3-540-45687-2_12
URL : https://hal.archives-ouvertes.fr/hal-00693661
, Finite automata, definable sets, and regular expressions over ??n-tapes, Journal of Computer and System Sciences, vol.17, issue.1, pp.81-97, 1978.
DOI : 10.1016/0022-0000(78)90036-3
URL : http://doi.org/10.1016/0022-0000(78)90036-3
, Frontiers of infinite trees, RAIRO. Informatique th??orique, vol.12, issue.4, pp.319-337, 1978.
DOI : 10.1051/ita/1978120403191
, Real-time automata, Journal of Automata, Languages and Combinatorics, vol.6, issue.1, pp.3-24, 2001.
, Bilimites de langages reconnaissables, Theoretical Computer Science, vol.33, issue.2-3, pp.335-342, 1984.
DOI : 10.1016/0304-3975(84)90095-1
URL : http://doi.org/10.1016/0304-3975(84)90095-1
, Finite divergence, Theoretical Computer Science, vol.138, issue.1, pp.113-139, 1995.
DOI : 10.1016/0304-3975(94)00145-9
URL : http://doi.org/10.1016/0304-3975(94)00145-9
, An algorithm for the solution of fixed-point equations for infinite words, RAIRO. Informatique th??orique, vol.14, issue.2, pp.131-141, 1980.
DOI : 10.1051/ita/1980140201311
, Representation of Events in Nerve Nets and Finite Automata, Automata studies, pp.3-41, 1956.
DOI : 10.1515/9781400882618-002
, Infinite sequences and finite machines, Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design (swct 1963), pp.3-16
DOI : 10.1109/SWCT.1963.8
, Ensembles reconnaissables de mots bi-infinis, Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp.47-59, 1982.
DOI : 10.1145/800070.802176
, Decidability of second-order theories and automata on infinite trees. Transactions of the, pp.1-35, 1969.
, Star free expressions over the reals, Theoretical Computer Science, vol.233, issue.1-2, pp.233-245, 2000.
DOI : 10.1016/S0304-3975(98)00050-4
, Complementation of Rational Sets on Countable Scattered Linear Orderings, Lect. Notes in Comput. Sci, vol.3340, pp.381-392, 2004.
DOI : 10.1007/978-3-540-30550-7_32
URL : https://hal.archives-ouvertes.fr/hal-00160985
, Linear orderings, 1982.
, The Monadic Theory of Order, The Annals of Mathematics, vol.102, issue.3, pp.379-419, 1975.
DOI : 10.2307/1971037
, On frontiers of regular sets, pp.371-381, 1986.
, Ehrenfeucht games, the composition method, and the monadic theory of ordinal words In Structures in Logic and Computer Science, A Selection of Essays in Honor of A. Ehrenfeucht, number 1261 in Lect, Notes in Comput. Sci, pp.118-143, 1997.
, Tree automata and automata on linear orderings, pp.222-231, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00403681
, Finite automata on transfinite sequences and regular expressions. Fundamenta informaticae, pp.379-396, 1985.