A Combinatorial Theorem for Trees

DOI10.1007/978-3-540-73420-8_77zbMath1171.03325OpenAlexW1777451655MaRDI QIDQ5428868

Thomas Colcombet

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_77

zbMATH Keywords

SemigroupsTreesMonadic second-order logicInfinite structuresRamseyan factorisation

Mathematics Subject Classification ID

Trees (05C05) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (11)

Unnamed Item ⋮ The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ Regular partitions of gentle graphs ⋮ The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ The Height of Factorization Forests ⋮ Unnamed Item ⋮ Factorization Forests ⋮ The factorisation forest theorem

This page was built for publication: A Combinatorial Theorem for Trees