A decidable characterization of locally testable tree languages

DOI10.2168/LMCS-7(4:3)2011zbMath1237.68119OpenAlexW1967613919MaRDI QIDQ3224693

Thomas Place, Luc Segoufin

Publication date: 2 April 2012

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

Full work available at URL: https://doi.org/10.2168/lmcs-7(4:3)2011

zbMATH Keywords

regular tree languageslocally testable

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (6)

The mu-calculus and Model Checking ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Homomorphic characterization of tree languages based on comma-free encoding ⋮ Automata on finite trees ⋮ Algebra for trees ⋮ The alphabetic complexity in homomorphic definitions of word, tree and picture languages

This page was built for publication: A decidable characterization of locally testable tree languages