You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics

Article type: Research Article

Authors: Ésik, Zoltán | Iván, Szabolcs

Affiliations: Department of Computer Science, University of Szeged, Hungary and GRLMC, Rovira i Virgili University, Tarragona, Spain. E-mail: [email protected] | Department of Computer Science, University of Szeged, Hungary. E-mail: [email protected]

Abstract: We provide structural descriptions of certain varieties of finite tree automata closed under a version of the cascade product, called the Moore product. As a byproduct, we obtain decidable characterizations of the expressive power of certain fragments of CTL on finite trees.

Journal: Fundamenta Informaticae, vol. 82, no. 1-2, pp. 79-103, 2008

Received 11 January 2008
|
Accepted 11 January 2008
|
Published: 2008
Price: EUR 27.50
Show more