Some varieties of finite tree automata related to restricted temporal logics

Zoltán Ésik, Szabolcs Iván

Research output: Contribution to journalArticle

8 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)79-103
Number of pages25
JournalFundamenta Informaticae
Volume82
Issue number1-2
Publication statusPublished - Jan 28 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Some varieties of finite tree automata related to restricted temporal logics'. Together they form a unique fingerprint.

  • Cite this