|
Search the dblp DataBase
Andreas Potthoff:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Andreas Potthoff
Modulo Counting Quantifiers Over Finite Trees. [Citation Graph (0, 0)][DBLP] CAAP, 1992, pp:265-278 [Conf]
- 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]
- Andreas Potthoff, Wolfgang Thomas
Regular Tree Languages Without Unary Symbols are Star-Free. [Citation Graph (0, 0)][DBLP] FCT, 1993, pp:396-405 [Conf]
- 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]
- Andreas Potthoff
First-Order Logic on Finite Trees. [Citation Graph (0, 0)][DBLP] TAPSOFT, 1995, pp:125-139 [Conf]
- 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
|