The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1990, volume: 73, number: 3

  1. Richard Beigel
    Bi-Immunity Results for Cheatable Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:3, pp:249-263 [Journal]
  2. Jianer Chen
    The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:3, pp:265-278 [Journal]
  3. Jochen Hoffmann, Michael G. Main
    Results on NLC Grammars with One-Letter Terminal Alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:3, pp:279-294 [Journal]
  4. Changwook Kim
    Complexity and Decidability for Restricted Classes of Picture Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:3, pp:295-311 [Journal]
  5. J. M. Robson
    Strong Time Bounds: Non-Computable Bounds and a Hierarchy Theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:3, pp:313-317 [Journal]
  6. Alan A. Bertossi, Fabrizio Luccio, Elena Lodi, Linda Pagli
    String Matching with Weighted Errors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:3, pp:319-328 [Journal]
  7. Tom Head
    The Set of Strings Mapped Into a Submonoid by Iterates of a Morphism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:3, pp:329-333 [Journal]
  8. William Schmitt
    Hopf Algebras and Identities in Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:3, pp:335-340 [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