A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Two-letter group codes that preserve aperiodicity of inverse finite automata
2007
Semigroup Forum
We 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
doi:10.1007/s00233-007-9024-6
fatcat:5p4ngj75g5dvfpbhuamofir7vy