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

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

2007-01-09

arxiv.org/abs/math/0701264v1

Mathematics

Group Theory

10 pages

Scientific paper

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 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.

Affiliated with

Also associated with

No associations

Rating

Two-letter group codes that preserve aperiodicity of inverse finite automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two-letter group codes that preserve aperiodicity of inverse finite automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-letter group codes that preserve aperiodicity of inverse finite automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-723105