The expansion problem for infinite trees

DOI10.46298/LMCS-22(1:20)2026MaRDI QIDQ6840491zbMATH OpenFDO

Authors Achim Blumensath

Publication date 23 March 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(1:20)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 6680130 (Why is no real title available?)
• scientific article; zbMATH DE number 7350772 (Why is no real title available?)
• scientific article; zbMATH DE number 7168152 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• A Combinatorial Theorem for Trees
• A Ramsey theorem for trees
• A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
• Algebra for Infinite Forests with an Application to the Temporal Logic EF
• An algebraic approach to MSO-definability on countable linear orderings
• An algebraic proof of Rabin's tree theorem
• Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems
• Automata on infinite trees
• Factorization forests of finite height
• On semigroups of matrices over the tropical semiring
• R-Automata
• Recognisability for algebras of infinite trees
• Regular languages of thin trees
• Regular tree languages in low levels of the Wadge hierarchy
• The Power-Set Construction for Tree Algebras
• The factorisation forest theorem

This page was built for publication: The expansion problem for infinite trees

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