Going Higher in the First-Order Quantifier Alternation Hierarchy on Words

From MaRDI portal
Publication:5167850

DOI10.1007/978-3-662-43951-7_29zbMath1407.03055arXiv1404.6832OpenAlexW209374521MaRDI QIDQ5167850

Thomas Place, Marc Zeitoun

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.6832




Related Items (29)

On Decidability of Intermediate Levels of Concatenation HierarchiesEfficient algorithms for membership in Boolean hierarchies of regular languagesLevel two of the quantifier alternation hierarchy over infinite wordsUnnamed ItemConcatenation hierarchies: new bottle, old wineThe half-levels of the \(\mathrm {FO}_2\) alternation hierarchyAlternation Hierarchies of First Order Logic with Regular PredicatesA Note on Decidable Separability by Piecewise Testable LanguagesSeparability by piecewise testable languages is \textsc{PTime}-completeThe omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchiesUnnamed ItemSeparating Without Any Ambiguity.The \(\omega\)-inequality problem for concatenation hierarchies of star-free languagesLevel Two of the Quantifier Alternation Hierarchy over Infinite WordsUnnamed ItemPro-aperiodic monoids via saturated modelsLocal testability from words to traces, a suitable definitionUnnamed ItemQuantifier Alternation for Infinite WordsUnnamed ItemSeparating regular languages with two quantifier alternationsThe Complexity of Separation for Levels in Concatenation HierarchiesOn All Things Star-FreeGeneric results for concatenation hierarchiesUnnamed ItemThe Quantifier Alternation Hierarchy of Synchronous RelationsVarietiesProfinite topologiesThe factorisation forest theorem




This page was built for publication: Going Higher in the First-Order Quantifier Alternation Hierarchy on Words