Andreas Potthoff

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1995
First-Order Logic on Finite Trees.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

1994
Logische Klassifizierung regulärer Baumsprachen.
PhD thesis, 1994

Modulo-Counting Quantifiers Over Finite Trees.
Theor. Comput. Sci., 1994

1993
Regular Tree Languages Without Unary Symbols are Star-Free.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Tree Languages Recognizable by Regular Frontier Check.
Proceedings of the Developments in Language Theory, 1993

1989
AMORE: A System for Computing Automata, MOnoids, and Regular Expressions.
Proceedings of the STACS 89, 1989


  Loading...