Algebra for Infinite Forests with an Application to the Temporal Logic EF

DOI10.1007/978-3-642-04081-8_10zbMath1254.68158OpenAlexW1595607777MaRDI QIDQ3184670

Mikołaj Bojańczyk, Tomasz Idziaszek

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_10

Mathematics Subject Classification ID

Trees (05C05) Algebraic theory of languages and automata (68Q70) Temporal logic (03B44)

Related Items (9)

Regular languages of thin trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Note on Decidable Separability by Piecewise Testable Languages ⋮ Unnamed Item ⋮ Deciding the existence of uniform interpolants over transitive models ⋮ Recognisability for algebras of infinite trees ⋮ Algebra for trees

Cites Work

• Unnamed Item
• Unnamed Item
• Recognisability for algebras of infinite trees
• Characterizing EF and EX tree logics
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
• STACS 2005
• Tree Languages Defined in First-Order Logic with One Quantifier Alternation

This page was built for publication: Algebra for Infinite Forests with an Application to the Temporal Logic EF