The Monadic Theory of Tree-like Structures

DOI10.1007/3-540-36387-4_16zbMath1021.68051OpenAlexW1553720870MaRDI QIDQ4412839

Dietmar Berwanger, Achim Blumensath

Publication date: 16 July 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36387-4_16

zbMATH Keywords

tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Related Items (8)

Simple monadic theories and partition width ⋮ Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ Model Transformations in Decidability Proofs for Monadic Theories ⋮ On the structure of graphs in the Caucal hierarchy ⋮ On Monadic Theories of Monadic Predicates ⋮ Iterated pushdown automata and sequences of rational numbers ⋮ Automata on infinite trees

This page was built for publication: The Monadic Theory of Tree-like Structures