Tree Languages Defined in First-Order Logic with One Quantifier Alternation
From MaRDI portal
Publication:5894002
DOI10.2168/LMCS-6(4:1)2010zbMath1202.03047arXiv1009.2854MaRDI QIDQ5894002
Luc Segoufin, Mikołaj Bojańczyk
Publication date: 20 December 2010
Published in: Logical Methods in Computer Science, Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.2854
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
03B25: Decidability of theories and sets of sentences
Related Items
Deciding twig-definability of node selecting tree automata, Fragments of first-order logic over infinite words, Axiomatizing the equational theory of regular tree languages, Algebra for trees, Algebra for Infinite Forests with an Application to the Temporal Logic EF, Characterization of Logics over Ranked Tree Languages