scientific article; zbMATH DE number 7650891

DOI10.4230/LIPICS.STACS.2020.6MaRDI QIDQ5874276zbMATH OpenFDO

Authors Jan Philipp Wächter, Armin Weiß

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/1906.03424

zbMATH Keywords

automaton groupcompressed word problemPSPACEword problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(10)

• Compression techniques in group theory
• Orbit expandability of automaton semigroups and groups
• An automaton group with \textsf{PSPACE}-complete word problem
• On orbits and the finiteness of bounded automaton groups
• On the orbits of automaton semigroups and groups
• Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems
• The word problem for finitary automaton groups
• An Automaton Group with PSPACE-Complete Word Problem
• Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems
• On the structure theory of partial automaton semigroups

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874276)