Cascade Products and Temporal Logics on Finite Trees
From MaRDI portal
Publication:5262961
DOI10.1016/J.ENTCS.2005.12.081zbMATH Open1316.68061OpenAlexW1976693976MaRDI QIDQ5262961FDOQ5262961
Authors: 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
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Temporal logic (03B44)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Temporal logic can be more expressive
- Title not available (Why is that?)
- Generalized finite automata theory with an application to a decision problem of second-order logic
- On the expressive power of temporal logic
- Regular languages defined with generalized quantifiers
- General varieties of tree languages
- Title not available (Why is that?)
- Verification of reactive systems. Formal methods and algorithms.
- CONCUR 2004 - Concurrency Theory
- Title not available (Why is that?)
- Cascades of tree-automata and computations in universal algebras
Cited In (3)
This page was built for publication: Cascade Products and Temporal Logics on Finite Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262961)