Two-letter group codes that preserve aperiodicity of inverse finite automata

Simple item page
dc.creatorBirget, Jean-Camille
dc.creatorMargolis, Stuart W.
dc.date2007-01-09
dc.date.accessioned2026-07-07T07:39:27Z
dc.date.available2026-07-07T07:39:27Z
dc.descriptionWe construct group codes over two letters (i.e., bases of subgroups of a two-generated free group) with special properties. Such group codes can be used for reducing algorithmic problems over large alphabets to algorithmic problems over a two-letter alphabet. Our group codes preserve aperiodicity of inverse finite automata. As an application we show that the following problems are PSpace-complete for two-letter alphabets (this was previously known for large enough finite alphabets): The intersection-emptiness problem for inverse finite automata, the aperiodicity problem for inverse finite automata, and the closure-under-radical problem for finitely generated subgroups of a free group. The membership problem for 3-generated inverse monoids is PSpace-complete.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0701264
dc.identifierhttp://arxiv.org/abs/math/0701264
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/121458
dc.subjectGroup Theory
dc.titleTwo-letter group codes that preserve aperiodicity of inverse finite automata
dc.typetext

Files

Collections

arXiv