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