Cascade Products and Temporal Logics on Finite Trees

Research output: Article

Abstract

We use the cascade product of tree automata to give an algebraic characterization of the expressive power of CTL-like temporal logis on finite trees.

Original languageEnglish
Pages (from-to)163-166
Number of pages4
JournalElectronic Notes in Theoretical Computer Science
Volume162
Issue number1
DOIs
Publication statusPublished - szept. 29 2006

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this