Separating Regular Languages with Two Quantifiers Alternations
From MaRDI portal
Publication:4635804
DOI10.1109/LICS.2015.28zbMath1401.03067OpenAlexW1576799344MaRDI QIDQ4635804
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/lics.2015.28
Automata and formal grammars in connection with logical questions (03D05) Classical first-order logic (03B10) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (13)
On Decidability of Intermediate Levels of Concatenation Hierarchies ⋮ Concatenation hierarchies: new bottle, old wine ⋮ Unnamed Item ⋮ The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies ⋮ Separating Without Any Ambiguity. ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ Unnamed Item ⋮ Quantifier Alternation for Infinite Words ⋮ Unnamed Item ⋮ Separating regular languages with two quantifier alternations ⋮ On All Things Star-Free ⋮ Generic results for concatenation hierarchies ⋮ Varieties
This page was built for publication: Separating Regular Languages with Two Quantifiers Alternations