AMORE: A System for Computing Automata, MOnoids, and Regular Expressions. - V. Kell; Albert Maier; Andreas Potthoff; Wolfgang Thomas; U. Wermuth (STACS, 1989)

Tree Languages Recognizable by Regular Frontier Check. - Eija Jurvanen; Andreas Potthoff; Wolfgang Thomas (Developments in Language Theory, 1993)

Regular Tree Languages Without Unary Symbols are Star-Free. - Andreas Potthoff; Wolfgang Thomas (FCT, 1993)

Modulo-Counting Quantifiers Over Finite Trees. - Andreas Potthoff (Theor. Comput. Sci., 1994)

Logische Klassifizierung regulärer Baumsprachen. - Andreas Potthoff (1994)

First-Order Logic on Finite Trees. - Andreas Potthoff (TAPSOFT, 1995)