Pointlike sets and separation: a personal perspective
From MaRDI portal
(Redirected from Publication:832918)
Cites work
- scientific article; zbMATH DE number 4049112 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1304310 (Why is no real title available?)
- scientific article; zbMATH DE number 459360 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1419247 (Why is no real title available?)
- scientific article; zbMATH DE number 3287733 (Why is no real title available?)
- A constructive version of the Ribes-Zalesskiĭ product theorem.
- A delay theorem for pointlikes
- APERIODIC POINTLIKES AND BEYOND
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- Abelian pointlikes of a monoid
- Adding Successor
- Aperiodic homomorphisms and the concatenation product of recognizable sets
- Categories as algebra: An essential ingredient in the theory of monoids
- Complexity of finite semigroups
- Covering and separation for logical fragments with modular predicates
- Finite semigroup varieties of the form V*D
- Finite state automata: a geometric approach
- Generic results for concatenation hierarchies
- Homomorphism of groups
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Improved lower bounds for the complexity of finite semigroups
- Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
- Monoid kernels and profinite topologies on the free Abelian group
- ON THE DECIDABILITY OF THE MEMBERSHIP PROBLEM OF THE PSEUDOVARIETY J∨B
- ORDERED CATEGORIES AND ORDERED SEMIGROUPS
- On Pointlike Sets and Joins of Pseudovarieties
- On The Profinite Topology on a Free Group
- On algorithmic problems for joins of pseudovarieties
- On finite monoids having only trivial subgroups
- On separation by locally testable and locally threshold testable languages
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- On the extension problem for partial permutations
- POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS
- POLYNOMIAL CLOSURE AND TOPOLOGY
- PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
- Pointlike sets for varieties determined by groups
- Pointlike sets with respect to R and J.
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem
- SC-hyperdecidability of \(\mathbf R\)
- Separating regular languages with first-order logic
- Separating regular languages with first-order logic
- Separation for dot-depth two
- Some algorithmic problems for pseudovarieties
- THE PRO-p TOPOLOGY OF A FREE GROUP AND ALGORITHMIC PROBLEMS IN SEMIGROUPS
- Tameness of joins involving the pseudovariety of local semilattices.
- Tameness of pseudovariety joins involving R.
- The Birkhoff theorem for finite algebras
- The \(\mathfrak q\)-theory of finite semigroups.
- The covering problem
- The pro-nilpotent group topology on a free group
- The pseudovariety $J$ is hyperdecidable
- Undecidability of the identity problem for finite semigroups
This page was built for publication: Pointlike sets and separation: a personal perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832918)
