Journals in DBLP

Journal of Automata, Languages and Combinatorics
1999, volume: 4, number: 3

1. Julien Cassaigne
   Double Sequences with Complexity mn+1. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:153-170 [Journal]
   
2. Christian Choffrut, Hratchia Pélibossian, Pierre Simonnet
   Decision Issues on Functions Realized by Finite Automata. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:171-182 [Journal]
   
3. Jeanne Devolder
   Generators with Bounded Deciphering Delay for Rational omega-Languages. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:183-204 [Journal]
   
4. Jean-Pierre Duval, Laurent Mouchard
   Sequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:205-212 [Journal]
   
5. Costas S. Iliopoulos, Laurent Mouchard
   Quasiperiodicity: From Detection to Normal Forms. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:213-228 [Journal]
   
6. Arnaud Maes
   An Automata Theoretic Decidability Proof for First-Order Theory of <N, {<}, P> with Morphic Predicate P. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:229-246 [Journal]
   
7. Jean-François Raskin, Pierre-Yves Schobbens
   The Logic of Event Clocks - Decidability, Complexity and Expressiveness. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:247-286 [Journal]