The SCEAS System
Navigation Menu

Conferences in DBLP

LITP Spring School on Theoretical Computer Science (litp)
1984 (conf/litp/1984)

  1. Dominique Perrin
    An introduction to finite automata on infinite words. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:2-17 [Conf]
  2. André Arnold
    Deterministic and non ambiguous rational omega-languages. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:18-27 [Conf]
  3. Danièle Beauquier
    Ensembles reconnaissables de mots bi -infinis limite et déterminisme. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:28-46 [Conf]
  4. Jean-Pierre Pécuchet
    Automates boustrophédon sur des mots infinis. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:47-54 [Conf]
  5. Jean-Eric Pin
    Star free omega-languages and first order logic. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:56-67 [Conf]
  6. Philippe Darondeau, Laurent Kott
    A formal proof system for infinitary rational expressions. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:68-80 [Conf]
  7. Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki
    Logical formulas and four subclasses of omega-regular languages. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:81-88 [Conf]
  8. M. W. Shields
    Deterministic asynchronous automata. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:89-98 [Conf]
  9. David E. Muller, Paul E. Schupp
    Alternating automata on infinite objects, determinacy and Rabin's theorem. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:100-107 [Conf]
  10. Jean-Pierre Braquelaire, Bruno Courcelle
    The solution of two star height problems for regular trees. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:108-117 [Conf]
  11. Max Dauchet, Erick Timmerman
    Decidability of yield's equality for infinite regular trees. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:118-136 [Conf]
  12. François Blanchard, Georges Hansel
    Languages and subshifts. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:138-146 [Conf]
  13. Tom Head
    The adherences of languages as topological spaces. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:147-163 [Conf]
  14. G. Rauzy
    Mots infinis en arithmétique. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:165-171 [Conf]
  15. Michel Leconte
    K-th power free codes. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:172-187 [Conf]
  16. Jean-Jacques Pansiot
    On various classes of infinite words obtained by iterated mappings. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:188-197 [Conf]
  17. Antonio Restivo, Sergio Salemi
    Overlap-free words on two symbols. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:198-206 [Conf]
  18. Patrice Séébold
    Overlap-free sequences. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:207-215 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002