The SCEAS System
Navigation Menu

Journals in DBLP

Fundam. Inform.
2001, volume: 45, number: 3

  1. János Apró, Sándor Vágvölgyi
    The Ground Tree Transducer Game with Identical Tree Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:157-172 [Journal]
  2. Philippe Balbiani, Dimiter Vakarelov
    Iteration-free PDL with Intersection: a Complete Axiomatization. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:173-194 [Journal]
  3. Jean-Marc Champarnaud, Djelloul Ziadi
    From Mirkin's Prebases to Antimirov's Word Partial Derivatives. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:195-205 [Journal]
  4. Petr Hájek, Sauro Tulipani
    Complexity of Fuzzy Probability Logics. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:207-213 [Journal]
  5. Padmanabhan Krishnan
    Decomposing Timed Push Down Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:215-229 [Journal]
  6. Alexander Meduna
    Uniform Generation of Languages by Scattered Context Grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:231-235 [Journal]
  7. Robert Saxon Milnikel
    Skeptical Reasoning in FC-Normal Logic Programs is P11-complete. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:237-252 [Journal]
  8. Bengt J. Nilsson
    Approximating a Shortest Watchman Route. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:253-281 [Journal]
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