Characterizing CTL-like logics on finite trees

Research output: Contribution to journalArticle

9 Citations (Scopus)


We associate a modal operator with each language belonging to a given class of regular tree languages and use the cascade product of tree automata to give an algebraic characterization of the expressive power of the resulting logic.

Original languageEnglish
Pages (from-to)136-152
Number of pages17
JournalTheoretical Computer Science
Issue number1-2
Publication statusPublished - May 5 2006


  • Cascade product
  • Pseudovariety
  • Temporal logic
  • Tree automata

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Characterizing CTL-like logics on finite trees'. Together they form a unique fingerprint.

  • Cite this