On the Algorithmic Decidability of the Square-Free Word Problem Relative to a System of Two Defining Relations
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605524793 | ||
| 003 | CHVBK | ||
| 005 | 20210128100755.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150201xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s10958-015-2219-6 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s10958-015-2219-6 | ||
| 100 | 1 | |a Polyakov |D N. |u Financial University under the Government of the Russian Federation, Moscow, Russia |4 aut | |
| 245 | 1 | 0 | |a On the Algorithmic Decidability of the Square-Free Word Problem Relative to a System of Two Defining Relations |h [Elektronische Daten] |c [N. Polyakov] |
| 520 | 3 | |a We prove that the square-free word problem relative to a system of two defining relations is algorithmically decidable. | |
| 540 | |a Springer Science+Business Media New York, 2015 | ||
| 773 | 0 | |t Journal of Mathematical Sciences |d Springer US; http://www.springer-ny.com |g 204/6(2015-02-01), 800-807 |x 1072-3374 |q 204:6<800 |1 2015 |2 204 |o 10958 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s10958-015-2219-6 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s10958-015-2219-6 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Polyakov |D N. |u Financial University under the Government of the Russian Federation, Moscow, Russia |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Journal of Mathematical Sciences |d Springer US; http://www.springer-ny.com |g 204/6(2015-02-01), 800-807 |x 1072-3374 |q 204:6<800 |1 2015 |2 204 |o 10958 | ||