Regular Tree Languages Without Unary Symbols are Star-Free.

Andreas Potthoff, Wolfgang Thomas

Browse the full FCT paper archive.