The SCEAS System
Navigation Menu

Journals in DBLP

Bulletin of the EATCS
1985, volume: 27, number:

  1. Michal P. Chytil, Martin Plátek, Jörg Vogel
    A note on the Chomsky hierarchy. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:23-29 [Journal]
  2. Karel Culik II, Juhani Karhumäki
    Decision problems solved with the help of the Ehrenfeucht conjecture. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:30-34 [Journal]
  3. Rusins Freivalds
    Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:35-39 [Journal]
  4. Juris Hartmanis
    Solvable problems with conflicting relativizations. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:40-48 [Journal]
  5. Jean-Pierre Jouannaud, Emmanuel Kounalis
    Proofs by induction in equational theories without constructors. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:49-55 [Journal]
  6. Edward Ochmanski
    Regular behaviour of concurrent systems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:56-67 [Journal]
  7. Dominique Perrin
    On the solution of Ehrenfeucht's conjecture. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:68-70 [Journal]
  8. Arto Salomaa
    The Ehrenfeucht conjecture: a proof for language theorists. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:71-82 [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