ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM

被引:1
|
作者
Steindl, Markus [1 ,2 ]
机构
[1] Johannes Kepler Univ Linz, Inst Algebra, Altenberger St 69, A-4040 Linz, Austria
[2] Univ Colorado, Dept Math, Campus Box 395, Boulder, CO 80309 USA
基金
奥地利科学基金会;
关键词
subalgebras of powers; membership test; computational complexity; PSPACE-complete; NP-complete;
D O I
10.1017/S1446788718000010
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Fix a finite semigroup S and let a(1), ..., a(k), b be tuples in a direct power S-n. The subpower membership problem (SMP) for S asks whether b can be generated by a(1), ..., a(k). For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups with adjoined identity, we obtain a trichotomy: the SMP is either in P, NP-complete, or PSPACE-complete. This result yields various semigroups with PSPACE-complete SMP including the six-element Brandt monoid, the full transformation semigroup on three or more letters, and semigroups of all n by n matrices over a field for n >= 2.
引用
收藏
页码:127 / 142
页数:16
相关论文
共 50 条
  • [1] The subpower membership problem for semigroups
    Bulatov, Andrei
    Kozik, Marcin
    Mayr, Peter
    Steindl, Markus
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2016, 26 (07) : 1435 - 1451
  • [2] Solving a PSPACE-complete problem with cP systems
    Henderson, Alec
    Nicolescu, Radu
    Dinneen, Michael J.
    JOURNAL OF MEMBRANE COMPUTING, 2020, 2 (04) : 311 - 322
  • [3] Solving a PSPACE-complete problem with cP systems
    Alec Henderson
    Radu Nicolescu
    Michael J. Dinneen
    Journal of Membrane Computing, 2020, 2 : 311 - 322
  • [4] An Automaton Group with PSPACE-Complete Word Problem
    Jan Philipp Wächter
    Armin Weiß
    Theory of Computing Systems, 2023, 67 : 178 - 218
  • [5] An Automaton Group with PSPACE-Complete Word Problem
    Waechter, Jan Philipp
    Weiss, Armin
    THEORY OF COMPUTING SYSTEMS, 2023, 67 (01) : 178 - 218
  • [6] Solving a PSPACE-complete problem by gene assembly
    Zerjatke, Thomas
    Sturm, Monika
    JOURNAL OF LOGIC AND COMPUTATION, 2013, 23 (04) : 897 - 908
  • [7] An Automaton Group with PSPACE-Complete Word Problem
    Waechter, Jan Philipp
    Weiss, Armin
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [8] SNOWMAN is PSPACE-complete
    He, Weihua
    Liu, Ziwen
    Yang, Chao
    THEORETICAL COMPUTER SCIENCE, 2017, 677 : 31 - 40
  • [9] Lemmings is PSPACE-complete
    Viglietta, Giovanni
    THEORETICAL COMPUTER SCIENCE, 2015, 586 : 120 - 134
  • [10] Lemmings Is PSPACE-Complete
    Viglietta, Giovanni
    FUN WITH ALGORITHMS, 2014, 8496 : 340 - 351