Characterizing EF and EX tree logics

DOI10.1016/j.tcs.2006.01.018zbMath1097.03013OpenAlexW1971672075MaRDI QIDQ2503041

Igor Walukiewicz, Mikołaj Bojańczyk

Publication date: 13 September 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.018

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)

Related Items (12)

Deciding twig-definability of node selecting tree automata ⋮ Some modal aspects of XPath ⋮ The mu-calculus and Model Checking ⋮ Algebra for Infinite Forests with an Application to the Temporal Logic EF ⋮ EF+EX Forest Algebras ⋮ On Pseudovarieties of Forest Algebras ⋮ Characterization of Logics over Ranked Tree Languages ⋮ ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES ⋮ Games for Temporal Logics on Trees ⋮ Automata on finite trees ⋮ Algebra for trees ⋮ Weak Separation Problem for Tree Languages

Uses Software

• XPath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propositional dynamic logic of regular programs
• Decidability of model checking for infinite-state concurrent systems
• Deciding Equivalence of Finite Tree Automata
• “Sometimes” and “not never” revisited
• Deciding low levels of tree-automata hierarchy
• First-order logic on finite trees
• On finite monoids having only trivial subgroups
• Generalized finite automata theory with an application to a decision problem of second-order logic
• STACS 2005

This page was built for publication: Characterizing EF and EX tree logics