The SCEAS System
Navigation Menu

Journals in DBLP

Fundam. Inform.
1997, volume: 30, number: 1

  1. William I. Gasarch, Mahendran Velauthapillai
    Asking Questions Versus Verifiability. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:1-9 [Journal]
  2. Astrid Kiehn, Matthew Hennessy
    On the Decidability of Non-Interleaving Process Equivalences. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:11-30 [Journal]
  3. Klaus Madlener, Friedrich Otto
    Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:31-44 [Journal]
  4. Gheorghe Paun
    Controlled H Systems and Chomsky Hierarchy. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:45-57 [Journal]
  5. Nicolas Peltier
    Tree Automata and Automated Model Building. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:59-81 [Journal]
  6. Boris A. Trakhtenbrot
    On the Power of Compositional Proofs for Nets: Relationships Between Completeness and Modularity. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:83-95 [Journal]
  7. Józef Winkowski
    A Representation of Processes of Petri Nets by Matrices. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:97-107 [Journal]
  8. Yan Zhang, Norman Y. Foo
    Deriving Invariants and Constraints from Action Theories. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:109-123 [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