Deciding Word Problems of Semigroups using Finite State Automata

From MaRDI portal
Revision as of 07:38, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6233542

arXiv1206.1714MaRDI QIDQ6233542FDOQ6233542

Max Neunhöffer, N. Ruškuc, Markus Pfeiffer

Publication date: 8 June 2012

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.












This page was built for publication: Deciding Word Problems of Semigroups using Finite State Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233542)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6233542&oldid=35758588"
Powered by MediaWiki