arXiv math/07012642007-01-09math.GR

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

Jean-Camille Birget, Stuart W. Margolis

备注：: 10 pages

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Groups generated by 3-state automata over a 2-letter alphabet, II

Classification of groups generated by 3-state automata over a 2-letter alphabet started in the first paper (see http://www.arxiv.org/abs/math/0612178) is continued.

2007-04-30math.GR

Classification of groups generated by 3-state automata over a 2-letter alphabet

This article contains most of the known results on the classification of groups generated by 3-state automata over a 2-letter alphabet, extending the previous papers 0704.3876 and math/0612178.

2008-03-25math.GR

Groups generated by 3-state automata over a 2-letter alphabet, I

An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite, abelian, and free groups are classified. In addition, we provide detailed information and complete proofs for several groups from the class, with the intention of showing the main methods and techniques used in the classification.

2006-12-07math.GR

An automata group of intermediate growth and exponential activity

We give a new example of an automata group of intermediate growth. It is generated by an automaton with 4 states on an alphabet with 8 letters. This automata group has exponential activity and its limit space is not simply connected.

2017-10-27math.GR

Some non-contracting automata groups

We add to the classification of groups generated by 3-state automata over a 2 letter alphabet given by Bondarenko et al., by showing that a number of the groups in the classification are non-contracting. We show that the criterion we use to prove a self-similar action is non-contracting also implies that the associated self-similarity graph introduced by Nekrashevych is non-hyperbolic.

2013-11-14math.GR

On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata

This paper addresses the torsion problem for a class of automaton semigroups, defined as semigroups of transformations induced by Mealy automata, aka letter-by-letter transducers with the same input and output alphabet. The torsion problem is undecidable for automaton semigroups in general, but is known to be solvable within the well-studied class of (semi)groups generated by invertible bounded Mealy automata. We focus on the somehow antipodal class of invertible reversible Mealy automata and prove that for a wide subclass the generated semigroup is torsion-free.

2014-12-02cs.FLmath.GR

更多相关论文收起更多论文

The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable

We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-state invertible-reversible Mealy automata.

2013-10-22cs.FLmath.GR

连接拉丁方与双可逆自动机的组合结构

Combinatorial structures connecting Latin squares and bireversible automata

University of South Florida（南佛罗里达大学）

从组合视角探索字母变换器等自动机理论，将其转移集视为正交阵列类似物，讨论相关组合编码，用组合结构刻画各类自动机，提出字母变换器同构概念，推广对称性并保持双可逆自动机类别。

2026-07-29cs.FLmath.COmath.GR

On the Structure Theory of Partial Automaton Semigroups

We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we specifically investigate semigroups generated by partial automata. First, we show that the class of semigroups generated by partial automata coincides with the class of semigroups generated by complete automata if and only if the latter class is closed under removing a previously adjoined zero, which is an open problem in (complete) automaton semigroup theory stated…

2020-07-16cs.FLmath.GR

关于作为自同构群子群出现的圈积

On wreath product occurring as subgroup of automata group

本文证明若G为自同构群子群，则对任意有限生成阿贝尔群A，圈积A≀G仍为自同构群子群，并解决Kourovka笔记中关于Z≀(Z≀Z)为双字母自同构群子群的问题。

2024-05-26math.GR

Self-similar groups acting essentially freely on the boundary of the binary rooted tree

We study the class of groups generated by automata that act essentially freely on the boundary of a rooted tree. In the process we establish and discuss some general tools for determining if a group belongs to this class, and explore the connections of this class to the classes of just-infinite and scale-invariant groups. Our main application is a complete classification of groups generated by 3-state automata over 2-letter alphabet that are in this class.

2013-08-12math.GR

关于有界自动群中ET0L子群成员问题

On the ET0L subgroup membership problem in bounded automata groups

本文研究了有界自动群中无限射线稳定子群的成员问题，证明其形成可构造的ET0L语言，并给出了生成函数的递归公式。

2025-11-26cs.FLmath.GR

有限自动机群的字问题

The Word Problem for Finitary Automaton Groups

本文研究有限自动机群的一致字问题与压缩字问题，通过从布尔公式可满足性直接归约，证明二者分别为 coNP 完全和 PSpace 完全，且二元字母表限制下结论不变。

2024-03-12cs.FLmath.GR