Andreas Potthoff

According to our database, Andreas Potthoff authored at least 6 papers between 1989 and 1995.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1995

First-Order Logic on Finite Trees.

Andreas Potthoff

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

1994

Logische Klassifizierung regulärer Baumsprachen.

Andreas Potthoff

PhD thesis, 1994

Modulo-Counting Quantifiers Over Finite Trees.

Andreas Potthoff

Theor. Comput. Sci., 1994

1993

Regular Tree Languages Without Unary Symbols are Star-Free.

Andreas Potthoff, Wolfgang Thomas

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Tree Languages Recognizable by Regular Frontier Check.

Eija Jurvanen, Andreas Potthoff, Wolfgang Thomas

Proceedings of the Developments in Language Theory, 1993

1989

AMORE: A System for Computing Automata, MOnoids, and Regular Expressions.

V. Kell, Albert Maier, Andreas Potthoff, Wolfgang Thomas, U. Wermuth

Proceedings of the STACS 89, 1989