The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Andreas Potthoff: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Potthoff
    Modulo Counting Quantifiers Over Finite Trees. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:265-278 [Conf]
  2. Eija Jurvanen, Andreas Potthoff, Wolfgang Thomas
    Tree Languages Recognizable by Regular Frontier Check. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:3-17 [Conf]
  3. Andreas Potthoff, Wolfgang Thomas
    Regular Tree Languages Without Unary Symbols are Star-Free. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:396-405 [Conf]
  4. V. Kell, Albert Maier, Andreas Potthoff, Wolfgang Thomas, U. Wermuth
    AMORE: A System for Computing Automata, MOnoidsm and Regular Expressions. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:537-538 [Conf]
  5. Andreas Potthoff
    First-Order Logic on Finite Trees. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:125-139 [Conf]
  6. Andreas Potthoff
    Modulo-Counting Quantifiers Over Finite Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:126, n:1, pp:97-112 [Journal]

Search in 0.001secs, Finished in 0.001secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002