Separating regular languages with two quantifiers alternations
From MaRDI portal
Recommendations
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Going Higher in First-Order Quantifier Alternation Hierarchies on Words
- Quantifier alternation for infinite words
- Quantifier alternation in two-variable first-order logic with successor is decidable
- Alternation hierarchies of first order logic with regular predicates
Cited in
(17)- Complexity of universality and related problems for partially ordered NFAs
- Varieties
- Generic results for concatenation hierarchies
- Concatenation hierarchies: new bottle, old wine
- Separating regular languages with first-order logic
- Quantifier alternation for infinite words
- On upper and lower bounds on the length of alternating towers
- Alternation hierarchies of first order logic with regular predicates
- On decidability of intermediate levels of concatenation hierarchies
- Separating regular languages with two quantifier alternations
- The covering problem
- Separating regular languages with first-order logic
- Partially ordered automata and piecewise testability
- Separating Without Any Ambiguity.
- On All Things Star-Free
- Covering and separation for logical fragments with modular predicates
- The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
This page was built for publication: Separating regular languages with two quantifiers alternations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635804)