The \(\kappa\)-word problem over \(\mathsf{DRH}\)
From MaRDI portal
Publication:1676315
DOI10.1016/j.tcs.2017.08.008zbMath1418.20014arXiv1512.01023OpenAlexW2755533536MaRDI QIDQ1676315
Publication date: 6 November 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.01023
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitive orthogonal idempotents for \(R\)-trivial monoids.
- The word problem for \(\omega \)-terms over DA
- Tameness of pseudovariety joins involving R.
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R
- Description and analysis of a bottom-up DFA minimization algorithm
- Languages of R-trivial monoids
- Sur le produit de concatenation non ambigu
- Profinite categories and semidirect products
- Locality of DS and associated varieties
- Pointlike sets with respect to R and J.
- Undecidability of the identity problem for finite semigroups
- REDUCED FACTORIZATIONS IN FREE PROFINITE GROUPS AND JOIN DECOMPOSITIONS OF PSEUDOVARIETIES
- Defining Relations and the Algebraic Structure of the Group SL2 over Integral Hamilton Quaternions
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- FREE PROFINITE SEMIGROUPS OVER SOME CLASSES OF SEMIGROUPS LOCALLY IN ${\mathcal D} {\rm G}$
- On the extension problem for partial permutations
- ALGORITHMIC PROBLEMS IN VARIETIES
- Markov chains, ${\mathscr R}$-trivial monoids and representation theory
- The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
- LATIN 2004: Theoretical Informatics
- SC-hyperdecidability of \(\mathbf R\)
