Paper Info
Title
Systolic tree &ohgr;-languages: the operational and the logical view
Abstract
. The class of !-languages recognized by systolic (binary) treeautomata is introduced. That class extends the class of Buchi !-lan-guages though maintaining the closure under union, intersection andcomplement and the decidability of emptiness. The class of systolic tree!-languages is characterized in terms of a (suitable) concatenation of(finitary) systolic tree languages. A generalization of Buchi Theorem isprovided which establishes a correspondence between systolic tree !-lan-...
Year
DOI
Venue
2000
10.1016/S0304-3975(97)00257-0
Theor. Comput. Sci.
Keywords
DocType
Volume
logical view,Systolic tree
Journal
233
Issue
ISSN
Citations 
1-2
0304-3975
4
PageRank 
References 
Authors
0.53
5
2
Name
Order
Citations
PageRank
Angelo Monti167146.93
Adriano Peron238145.82