Showing 2023Show all
3 papers · 1 filter
math.GR2023
Word automatic groups of nilpotency class 2
Andre Nies, Frank Stephan
We consider word automaticity for groups that are nilpotent of class and have exponent a prime . We show that the infinitely generated free group in this variety is not word…
cs.FL2023
String Compression in FA-Presentable Structures
Dmitry Berdinsky, Sanjay Jain, Bakhadyr Khoussainov +1
We construct a FA-presentation of the structure for which a numerical characteristic defined as the maximum number $ψ…
cs.FL2023
Languages given by Finite Automata over the Unary Alphabet
Wojciech Czerwiński, Maciej Dębski, Tomasz Gogasz +5
This paper studies the complexity of operations on finite automata and the complexity of their decision problems when the alphabet is unary. Let denote the maximum of the numbe…