SC-hyperdecidability of \(\mathbf R\)
From MaRDI portal
Publication:5941087
DOI10.1016/S0304-3975(99)00329-1zbMath0989.20045MaRDI QIDQ5941087
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
\(\mathcal L\)-trivial finite monoids\(\mathcal R\)-trivial finite monoidsinevitabilityinevitable labellingslabellingspseudovarieties of finite groupspseudovarieties of monoids
Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Pointlike sets and separation: a personal perspective ⋮ The \(\kappa\)-word problem over \(\mathsf{DRH}\) ⋮ Conelikes and ranker comparisons ⋮ Complete κ-reducibility of pseudovarieties of the form DRH ⋮ Pointlike sets with respect to R and J. ⋮ Profinite topologies ⋮ Tameness of pseudovariety joins involving R.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Profinite categories and semidirect products
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- On the hyperdecidability of semidirect products of pseudovarieties
- The pseudovariety $J$ is hyperdecidable
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- On Pointlike Sets and Joins of Pseudovarieties
