On non-counting regular classes
[For the entire collection see Zbl 0758.00017.] The main result of this paper is the following theorem: Let \(n\geq 5\). For any \(r\in M=A^*/\theta\) the Rees quotient \(N_ r=F_ r\cup\{0\}\) is finite. Therefrom one derives a positive solution of the ``regularity of non-counting classes --- conjecture for \(n\geq 5\). More precisely one has: Let \(n\) be a fixed integer \(\geq 5\). For any \(w\in A^*\) the congruence class \([w]_ n\) is a regular language. The proof has been obtained both by algebraic and by combinatorical techniques. However, the cases \(n=2\) and \(n=3\) cannot be dealt with by our combinatorial tools. We believe, and we have strong evidence for this, that a slight refinement of our techniques will enable us to give a positive answer to the conjecture in the case \(n=4\).
- On noncounting regular classes
- On nontotients
- On the word problem for the free Burnside semigroups satisfying x^2=x^3.
- Stefano Varricchio (1960-2008)
- Obituary: Aldo de Luca 1941--2018
- Free Burnside Semigroups
- Algebraic and topological theory of languages
- Semigroups satisfying x m+n = x n
- On finitely recognizable semigroups
This page was built for publication: On non-counting regular classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038682)
