Publication:5894002: Difference between revisions
From MaRDI portal
Publication:5894002
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Tree Languages Defined in First-Order Logic with One Quantifier Alternation to Tree Languages Defined in First-Order Logic with One Quantifier Alternation: Duplicate |
(No difference)
| |
Latest revision as of 14:54, 2 May 2024
DOI10.2168/LMCS-6(4:1)2010zbMath1202.03047arXiv1009.2854OpenAlexW1879697109MaRDI 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
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)
Deciding twig-definability of node selecting tree automata ⋮ Axiomatizing the equational theory of regular tree languages ⋮ Algebra for Infinite Forests with an Application to the Temporal Logic EF ⋮ Characterization of Logics over Ranked Tree Languages ⋮ Fragments of first-order logic over infinite words ⋮ Algebra for trees
This page was built for publication: Tree Languages Defined in First-Order Logic with One Quantifier Alternation
