The finite basis problem for words with at most two non-linear variables. (Q305772): Difference between revisions

Let \(\mathfrak A\) be an alphabet (its elements are called variables), \(W\subseteq\mathfrak A^*\) and \(S(W)\) the Rees quotient over the ideal of \(\mathfrak A^*\) consisting of all words that are not subwords of words from \(W\); \(W\) is called finitely based iff \(S(W)\) is finitely based, i.e. has finite basis of identities. Here are presented two algorithms for recognizing finitely based words with at most two non-linear variables, i.e. variables, occurring more than once.