Systolic tree ฯ-languages: the operation
โ
Angelo Monti; Adriano Peron
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 187 KB
The class of !-languages recognized by systolic (binary) tree automata is introduced. This class extends the class of B uchi !-languages though maintaining the closure under union, intersection and complement and the decidability of emptiness. The class of systolic tree !-languages is characterized