The finite basis problem for words with at most two non-linear variables. (Q305772): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434565540 |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3099273318 / rank | |||
Normal rank |
Revision as of 02:35, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The finite basis problem for words with at most two non-linear variables. |
scientific article |
Statements
The finite basis problem for words with at most two non-linear variables. (English)
0 references
30 August 2016
0 references
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.
0 references
semigroup identities
0 references
semigroup varieties
0 references
finite basis problem
0 references
isoterms
0 references
finitely based monoids
0 references
bases of identities
0 references
alphabets
0 references
free monoids
0 references
Rees quotients
0 references
inherently non-finitely based monoids
0 references