Regular tree languages definable in FO and in FO mod

DOI10.1145/1614431.1614435zbMath1351.68134OpenAlexW2012552318MaRDI QIDQ2946590

Michael Benedikt, Luc Segoufin

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1614431.1614435

zbMATH Keywords

first-order logicregular tree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (8)

Deciding twig-definability of node selecting tree automata ⋮ The mu-calculus and Model Checking ⋮ EF+EX Forest Algebras ⋮ A Note on Decidable Separability by Piecewise Testable Languages ⋮ On the locality of arb-invariant first-order formulas with modulo counting quantifiers ⋮ Unnamed Item ⋮ Automata on finite trees ⋮ Algebra for trees

This page was built for publication: Regular tree languages definable in FO and in FO _mod