Cascade Products and Temporal Logics on Finite Trees

DOI10.1016/j.entcs.2005.12.081zbMath1316.68061OpenAlexW1976693976MaRDI QIDQ5262961

Zoltán Ésik

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.081

zbMATH Keywords

temporal logictree automatacascade productpseudovariety

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Temporal logic (03B44)

Cites Work

• General varieties of tree languages
• Verification of reactive systems. Formal methods and algorithms.
• Regular languages defined with generalized quantifiers
• On the expressive power of temporal logic
• Temporal logic can be more expressive
• Cascades of tree-automata and computations in universal algebras
• CONCUR 2004 - Concurrency Theory
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cascade Products and Temporal Logics on Finite Trees