Pointlike sets and separation: a personal perspective

DOI10.1007/978-3-030-81508-0_3OpenAlexW3187077744MaRDI QIDQ832918

Benjamin Steinberg

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_3

zbMATH Keywords

separationpointlike sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The pro-nilpotent group topology on a free group
• Categories as algebra: An essential ingredient in the theory of monoids
• Tameness of pseudovariety joins involving R.
• The Birkhoff theorem for finite algebras
• Aperiodic homomorphisms and the concatenation product of recognizable sets
• Abelian pointlikes of a monoid
• A constructive version of the Ribes-Zalesskiĭ product theorem.
• Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem
• Pointlike sets: the finest aperiodic cover of a finite semigroup
• Finite semigroup varieties of the form V*D
• Generic results for concatenation hierarchies
• Pointlike sets with respect to R and J.
• Complexity of finite semigroups
• Improved lower bounds for the complexity of finite semigroups
• Pointlike sets for varieties determined by groups
• Homomorphism of groups
• Finite state automata: A geometric approach
• Separating Regular Languages with First-Order Logic
• On Separation by Locally Testable and Locally Threshold Testable Languages
• Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• APERIODIC POINTLIKES AND BEYOND
• Undecidability of the identity problem for finite semigroups
• ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
• On The Profinite Topology on a Free Group
• THE PRO-p TOPOLOGY OF A FREE GROUP AND ALGORITHMIC PROBLEMS IN SEMIGROUPS
• The pseudovariety $J$ is hyperdecidable
• On the Decidability of Iterated Semidirect Products with Applications to Complexity
• PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
• POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS
• Separating regular languages with first-order logic
• ON THE DECIDABILITY OF THE MEMBERSHIP PROBLEM OF THE PSEUDOVARIETY J∨B
• On Pointlike Sets and Joins of Pseudovarieties
• POLYNOMIAL CLOSURE AND TOPOLOGY
• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
• ORDERED CATEGORIES AND ORDERED SEMIGROUPS
• On the extension problem for partial permutations
• TAMENESS OF JOINS INVOLVING THE PSEUDOVARIETY OF LOCAL SEMILATTICES
• Monoid kernels and profinite topologies on the free Abelian group
• Adding Successor
• On finite monoids having only trivial subgroups
• On algorithmic problems for joins of pseudovarieties
• SC-hyperdecidability of \(\mathbf R\)
• A delay theorem for pointlikes

This page was built for publication: Pointlike sets and separation: a personal perspective