Algebra for trees

DOI10.4171/AUTOMATA-1/22MaRDI QIDQ2074223zbMATH OpenOpenAlexFDO

Authors Mikołaj Bojańczyk

Publication date 4 February 2022

Full work available at URL https://doi.org/10.4171/automata-1/22

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 5872386
• scientific article; zbMATH DE number 5005936
• Algebraic characterization of logically defined tree languages
• Tree algebras and varieties of tree languages
• Algebraic recognizability of regular tree languages

Cites work

• scientific article; zbMATH DE number 3888931 (Why is no real title available?)
• scientific article; zbMATH DE number 4108163 (Why is no real title available?)
• scientific article; zbMATH DE number 522865 (Why is no real title available?)
• scientific article; zbMATH DE number 5794052 (Why is no real title available?)
• A decidable characterization of locally testable tree languages
• Algebra for Infinite Forests with an Application to the Temporal Logic EF
• Algebraic recognizability of regular tree languages
• An algebraic characterization of frontier testable tree languages
• An algebraic proof of Rabin's tree theorem
• Characterization of Logics over Ranked Tree Languages
• Characterizing CTL-like logics on finite trees.
• Characterizing EF and EX tree logics
• Deciding piecewise testable separability for regular tree languages
• First-order properties of trees, star-free expressions, and aperiodicity
• Generalized finite automata theory with an application to a decision problem of second-order logic
• It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton
• Modulo-counting quantifiers over finite trees
• Piecewise testable tree languages
• Products of tree automata with an application to temporal logic
• Recognisability for algebras of infinite trees
• Recognisable languages over monads
• Regular languages of infinite trees that are Boolean combinations of open sets
• Regular languages of thin trees
• Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)
• Some results onC-varieties
• Some varieties of finite tree automata related to restricted temporal logics
• The structure of finite algebras
• Tree-walking automata cannot be determinized
• Two-Way Unary Temporal Logic over Trees
• Wreath products of distributive forest algebras
• Wreath products of forest algebras, with applications to tree logics

Cited in

(5)

• Algebraic characterization of logically defined tree languages
• A formula about tree
• Monadic monadic second order logic
• Stone pseudovarieties
• First-order Logic with Connectivity Operators

This page was built for publication: Algebra for trees

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