The finite basis problem for words with at most two non-linear variables. (Q305772): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Jaak Henno / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M07 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6620658 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semigroup identities | |||
Property / zbMATH Keywords: semigroup identities / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semigroup varieties | |||
Property / zbMATH Keywords: semigroup varieties / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finite basis problem | |||
Property / zbMATH Keywords: finite basis problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
isoterms | |||
Property / zbMATH Keywords: isoterms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finitely based monoids | |||
Property / zbMATH Keywords: finitely based monoids / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bases of identities | |||
Property / zbMATH Keywords: bases of identities / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
alphabets | |||
Property / zbMATH Keywords: alphabets / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
free monoids | |||
Property / zbMATH Keywords: free monoids / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Rees quotients | |||
Property / zbMATH Keywords: Rees quotients / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
inherently non-finitely based monoids | |||
Property / zbMATH Keywords: inherently non-finitely based monoids / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3099273318 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1403.6430 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3765976 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2740982 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bases for equational theories of semi-groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: FINITELY BASED, FINITE SETS OF WORDS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE FINITE BASIS PROBLEM FOR THE MONOID OF TWO-BY-TWO UPPER TRIANGULAR TROPICAL MATRICES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polyhedral convex cones and the equational theory of the bicyclic semigroup / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the axiomatic rank of varieties generated by a semigroup or monoid with one defining relation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: FINITELY BASED WORDS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finiteness properties of varieties and the restriction to finite algebras. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the finite basis problem for certain 2-limited words. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-finitely based monoids. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finitely based monoids. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5404573 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2754914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3853827 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4145882 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finitely based sets of 2-limited block-2-simple words / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:33, 12 July 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
0 references
0 references