Decidability versus undecidability of the word problem in amalgams of inverse semigroups. (Q3449708)
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: Decidability versus undecidability of the word problem in amalgams of inverse semigroups. |
scientific article; zbMATH DE number 6504874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidability versus undecidability of the word problem in amalgams of inverse semigroups. |
scientific article; zbMATH DE number 6504874 |
Statements
Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups (English)
0 references
5 November 2015
0 references
inverse semigroups
0 references
amalgamated free products
0 references
word problem
0 references
Schützenberger automata
0 references
0 references
0 references
0.918695628643036
0 references
0.91424959897995
0 references
0.9126914739608764
0 references
0.8970162868499756
0 references
0.8855015635490417
0 references
