Deciding Word Problems of Semigroups using Finite State Automata
Formal Languages and Automata Theory
2019-10-17 v4 Combinatorics
Group Theory
Abstract
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and algebraic properties of these semigroups.
Cite
@article{arxiv.1206.1714,
title = {Deciding Word Problems of Semigroups using Finite State Automata},
author = {Max Neunhöffer and Markus Pfeiffer and Nik Ruskuc},
journal= {arXiv preprint arXiv:1206.1714},
year = {2019}
}