Undecidable problems for completely 0-simple semigroups / Jackson Marcel,Volkov Mikhail // JOURNAL OF PURE AND APPLIED ALGEBRA. - 2009. - V. 213, l. 10. - P. 1961-1978.

ISSN/EISSN:

0022-4049 / нет данных

Type:

Article

Abstract:

The decidability of the uniform word problem in a pseudovariety v of groups is known to be equivalent to the decidability of a number of embedding problems for finite semigroups in classes related to completely 0-simple semigroups with subgroups from v. Unfortunately the existing proof of some of these equivalences turns Out to Contain all error. We provide an update on these types of properties, correcting the error and amending results accordingly. Several new undecidability properties are exhibited, some superceding previous results. A theme of many of the new contributions is problems that are solvable in polynomial time but become undecidable when a facet of their description is restricted by some finiteness condition. (C) 2009 Elsevier B.V. All rights reserved.

Author keywords:

FINITE-SEMIGROUPS; ALGORITHMIC PROBLEMS; AMALGAMS

DOI:

10.1016/j.jpaa.2009.02.011

Web of Science ID:

ISI:000266794700007

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	OCT
Publisher	ELSEVIER SCIENCE BV
Address	PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Language	English
Keywords-Plus	FINITE-SEMIGROUPS; ALGORITHMIC PROBLEMS; AMALGAMS
Research-Areas	Mathematics
Web-of-Science-Categories	Mathematics, Applied; Mathematics
Author-Email	M.G.Jackson@latrobe.edu.au Mikhail.Volkov@usu.ru
ResearcherID-Numbers	Volkov, Mikhail/F-1407-2014
ORCID-Numbers	Volkov, Mikhail/0000-0002-9327-243X
Number-of-Cited-References	23
Journal-ISO	J. Pure Appl. Algebr.
Doc-Delivery-Number	455VI