Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (Q1854344)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. |
scientific article; zbMATH DE number 1853102
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. |
scientific article; zbMATH DE number 1853102 |
Statements
Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (English)
0 references
14 January 2003
0 references
decision procedures
0 references
uniform word problem
0 references
0 references
