The SCEAS System
Navigation Menu

Conferences in DBLP

Birthday ... (birthday)
1999 (conf/birthday/1999salomaa)

  1. Janusz A. Brzozowski, Helmut Jürgensen
    Semilattices of Fault Semiautomata. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:3-15 [Conf]
  2. Dora Giammarresi, Jean-Luc Ponty, Derick Wood
    Thompson Languages. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:16-24 [Conf]
  3. Balázs Imreh, Masami Ito
    On Some Special Classes of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:25-34 [Conf]
  4. Michel Latteux, Yves Roos
    Synchronized Shuffle and Regular Languages. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:35-44 [Conf]
  5. Kai Salomaa, Sheng Yu
    Synchronization Expressions: Characterization Results and Implementation. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:45-56 [Conf]
  6. Christian Choffrut, Serge Grigorieff
    Uniformization of Rational Relations. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:59-71 [Conf]
  7. Joost Engelfriet, Hendrik Jan Hoogeboom
    Tree-Walking Pebble Automata. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:72-83 [Conf]
  8. Oscar H. Ibarra, Jianwen Su
    Counter Machines: Decision Problems and Applications. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:84-96 [Conf]
  9. Juhani Karhumäki, Leonid P. Lisovik
    On the Equivalence of Finite Substitutions and Transducers. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:97-108 [Conf]
  10. Wolfgang Thomas
    Complementation of Büchi Automata Revised. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:109-120 [Conf]
  11. Vesa Halava, Tero Harju
    Languages Accepted by Integer Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:123-134 [Conf]
  12. Juha Honkala
    A Power Series Approach to Bounded Languages. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:135-144 [Conf]
  13. Werner Kuich
    Full Abstract Families of Tree Series I. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:145-156 [Conf]
  14. Giovanna Melideo, Cesidia Pasquarelli, Stefano Varricchio
    Linear Automata, Rational Series and a Theorem of Fine and Wilf. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:157-168 [Conf]
  15. Jürgen Dassow
    Numerical Parameters of Evolutionary Grammars. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:171-181 [Conf]
  16. Vincenzo Manca, Carlos Martín-Vide, Gheorghe Paun
    Iterated GSM Mappings: A Collapsing Hierarchy. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:182-193 [Conf]
  17. Solomon Marcus
    On the Length of Words. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:194-203 [Conf]
  18. Robert McNaughton
    An Insertion into the Chomsky Hierarchy? [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:204-212 [Conf]
  19. Taishin Y. Nishida
    Word Length Controlled DT0L Systems and Slender Languages. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:213-221 [Conf]
  20. Cristian Calude, Richard J. Coles
    Program-Size Complexity of Initial Segments and Domination Reducibility. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:225-237 [Conf]
  21. Juraj Hromkovic
    Stability of Approximation Algorithms and the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:238-249 [Conf]
  22. Tao Jiang, Ming Li, Paul M. B. Vitányi
    Some Examples of Average-case Analysis by the Imcompressibility Method. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:250-261 [Conf]
  23. Wojciech Plandowski, Wojciech Rytter
    Complexity of Language Recognition Problems for Compressed Words. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:262-272 [Conf]
  24. Octavian Soldea, Azaria Paz
    Algorithms on Continued Fractions. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:273-284 [Conf]
  25. Jean Berstel
    On the Index of Sturmian Words. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:287-294 [Conf]
  26. Arturo Carpi, Aldo de Luca
    Repetitions and Boxes in Words and Pictures. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:295-306 [Conf]
  27. Karel Culik II
    Small Aperiodic Sets of Triangular and Hexagonal Tiles. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:307-313 [Conf]
  28. Volker Diekert, John Michael Robson
    Quadratic Word Equations. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:314-326 [Conf]
  29. Alexandru Mateescu, George Daniel Mateescu
    Fair and Associative Infinite Trajectories. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:327-338 [Conf]
  30. Filippo Mignosi, Antonio Restivo, Marinella Sciortino
    Forbidden Factors in Finite and Infinite Words. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:339-350 [Conf]
  31. Lila Kari, Jarkko Kari, Laura F. Landweber
    Reversible Molecular Computation in Ciliates. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:353-363 [Conf]
  32. Zdzislaw Pawlak
    Logic, Probability, and Rough Sets. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:364-373 [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