The covering problem
From MaRDI portal
Recommendations
Cites work
- Algebraic decision procedures for local testability
- Characterizations of locally testable events
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decision Problems of Finite Automata Design and Related Arithmetics
- Definability equals recognizability for graphs of bounded treewidth
- Efficient separability of regular languages by subsequences and suffixes
- First-order definable languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Graph congruences and wreath products
- Green's relations and their use in automata theory
- scientific article; zbMATH DE number 988805 (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 1304310 (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 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3186871 (Why is no real title available?)
- Locally testable languages
- On finite monoids having only trivial subgroups
- On separation by locally testable and locally threshold testable languages
- Polynomial closure and unambiguous product
- Regular languages of words over countable linear orderings
- Separating regular languages by piecewise testable and unambiguous languages
- Separating regular languages with first-order logic
- Separating regular languages with first-order logic
- Separating regular languages with two quantifiers alternations
- Separation and the successor relation
- Separation for dot-depth two
- The dot-depth hierarchy, 45 years later
- Theme and variations on the concatenation product
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(31)- Covering graphs: The covering problem solved
- Generic results for concatenation hierarchies
- The covering Canadian traveller problem
- A rectangular cover problem
- The complexity of coverage
- The Lebesgue universal covering problem
- scientific article; zbMATH DE number 3912199 (Why is no real title available?)
- scientific article; zbMATH DE number 482640 (Why is no real title available?)
- Separating regular languages with two quantifier alternations
- scientific article; zbMATH DE number 881169 (Why is no real title available?)
- A Best Covering Problem.
- Partially ordered automata and piecewise testability
- On All Things Star-Free
- Separation for dot-depth two
- Covering and separation for logical fragments with modular predicates
- Algorithms and Data Structures
- The Ferry Cover Problem
- Covering Problems
- The Maximal Conditional Covering Problem
- Covering Problems
- Conelikes and ranker comparisons
- First-order separation over countable ordinals
- The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
- On conditional covering problem
- All about unambiguous polynomial closure
- The amazing mixed polynomial closure and its applications to two-variable first-order logic
- Closing star-free closure
- Dot-depth three, return of the j-class
- The ordered covering problem
- Deciding classes of regular languages: the covering approach
- Pointlike sets and separation: a personal perspective
This page was built for publication: The covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580330)
