Separating regular languages with two quantifier alternations
From MaRDI portal
Recommendations
- Separating regular languages with two quantifiers alternations
- Separating regular languages with first-order logic
- Separating regular languages with first-order logic
- Regular Languages Definable by Majority Quantifiers with Two Variables
- scientific article; zbMATH DE number 4076666
- Regular languages defined with generalized quantifiers
- Separating regular languages by piecewise testable and unambiguous languages
- A complete refinement procedure for regular separability of context-free languages
- Efficient separability of regular languages by subsequences and suffixes
- scientific article; zbMATH DE number 4201629
Cites work
- A generalization of the Schützenberger product of finite monoids
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- Classification of finite monoids: the language approach
- Classifying regular events in symbolic logic
- Concatenation hierarchies: new bottle, old wine
- Dot-depth of star-free events
- Efficient separability of regular languages by subsequences and suffixes
- Factorization Forests
- Factorization forests for infinite words and applications to countable scattered linear orderings
- Factorization forests of finite height
- Finite semigroup varieties of the form V*D
- First-order logic and star-free sets
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- scientific article; zbMATH DE number 3827223 (Why is no real title available?)
- scientific article; zbMATH DE number 4034007 (Why is no real title available?)
- scientific article; zbMATH DE number 4035179 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 1223722 (Why is no real title available?)
- scientific article; zbMATH DE number 1500543 (Why is no real title available?)
- scientific article; zbMATH DE number 1775408 (Why is no real title available?)
- scientific article; zbMATH DE number 6851910 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On finite monoids having only trivial subgroups
- Polynomial closure and unambiguous product
- Semigroups and languages of dot-depth two
- Separating regular languages by piecewise testable and unambiguous languages
- Separating regular languages with two quantifiers alternations
- Separation and the successor relation
- Separation for dot-depth two
- The covering problem
- The dot-depth hierarchy of star-free languages is infinite
- The dot-depth hierarchy, 45 years later
- The Height of Factorization Forests
Cited in
(14)- Classifying regular languages by a split game
- Regular languages defined with generalized quantifiers
- Generic results for concatenation hierarchies
- Partially ordered automata and piecewise testability
- The Complexity of Separation for Levels in Concatenation Hierarchies
- On All Things Star-Free
- Separation for dot-depth two
- Covering and separation for logical fragments with modular predicates
- Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
- The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
- All about unambiguous polynomial closure
- The regular languages of first-order logic with one alternation
- Closing star-free closure
- A purely algebraic proof of the omega-reducibility of pseudovarieties representing low half levels of concatenation hierarchies
This page was built for publication: Separating regular languages with two quantifier alternations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558789)
