On Pointlike Sets and Joins of Pseudovarieties

From MaRDI portal
Revision as of 19:59, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4704548

DOI10.1142/S0218196798000119zbMath0942.20041MaRDI QIDQ4704548

Benjamin Steinberg

Publication date: 13 August 2000

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)




Related Items (28)

Reducibility of Joins Involving Some Locally Trivial PseudovarietiesON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPSINEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORYPROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPSPROFINITE METHODS IN SEMIGROUP THEORYCOMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORYPointlike sets and separation: a personal perspectiveTameness of Some Locally Trivial PseudovarietiesPointlike sets for varieties determined by groupsConelikes and ranker comparisonsClosures of regular languages for profinite topologies.Finite state automata: A geometric approachTowards a pseudoequational proof theoryPointlike sets with respect to R and J.WHAT ARE MODULES? AN OVERVIEW OF BRET TILSON'S PAPER "MODULES" FROM A GEOMETRIC VIEWPOINTA PROFINITE APPROACH TO STABLE PAIRSAPERIODIC POINTLIKES AND BEYONDSC-hyperdecidability of \(\mathbf R\)Monoid kernels and profinite topologies on the free Abelian groupSemidirect product with an order-computable pseudovariety and tameness.The geometry of profinite graphs with applications to free groups and finite monoidsVarietiesCOMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITYMerge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic PointlikesHYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTSPOINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPSUNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPSTameness of pseudovariety joins involving R.




Cites Work




This page was built for publication: On Pointlike Sets and Joins of Pseudovarieties