VOLUME 4 | 1999 | NUMBER 3 |
Selected Papers of Journées Montoises d'Informatique Théorique (Mons-Hainaut, Belgium, March 2–4, 1998)
Véronique Bruyère: | |
Editorial | 149–151 |
Julien Cassaigne: | |
Double Sequences with Complexity mn+1 | 153–170 |
Christian Choffrut, Hratchia Pelibossian, Pierre Simonnet: | |
Decision Issues on Functions Realized by Finite Automata | 171–181 |
Jeanne Devolder: | |
Generators with Bounded Deciphering Delay for Rational ω-Languages | 183–204 |
Jean-Pierre Duval, Laurent Mouchard: | |
Sequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words | 205–211 |
Costas S. Iliopoulos, Laurent Mouchard: | |
Quasiperiodicity: From Detection to Normal Forms | 213–228 |
Arnaud Maes: | |
An Automata Theoretic Decidability Proof for First-Order Theory of 〈ℕ,<,P〉 with Morphic Predicate P | 229–245 |
Jean-François Raskin, Pierre-Yves Schobbens: | |
The Logic of Event Clocks – Decidability, Complexity And Expressiveness | 247–282 |