Some varieties of finite tree automata related to restricted temporal logics

zbMATH Open1136.68038MaRDI QIDQ5450112FDOQ5450112

Authors: Szabolcs Iván, Zoltán Ésik 

Publication date: 19 March 2008

Recommendations

• Products of tree automata with an application to temporal logic
• Characterizing CTL-like logics on finite trees.
• scientific article; zbMATH DE number 3972842
• Timed tree automata with an application to temporal logic.
• The Complexity of Tree Automata and Logics of Programs

zbMATH Keywords

Moore product

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Temporal logic (03B44) Applications of universal algebra in computer science (08A70)

Cited In (5)

• Characterizing CTL-like logics on finite trees.
• Algebra for trees
• Products of tree automata with an application to temporal logic
• Games for Temporal Logics on Trees
• A model of finite automata on timed omega-trees

This page was built for publication: Some varieties of finite tree automata related to restricted temporal logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450112)