The Freeness Problem for Automaton Semigroups

From MaRDI portal

Revision as of 15:37, 28 November 2024 by Import241128011130 (talk | contribs) (Created automatically from import241128011130)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6520070

Jump to:navigation, search

arXiv2402.01372MaRDI QIDQ6520070FDOQ6520070

Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Representation of semigroups; actions of semigroups on sets (20M30) Free semigroups, generators and relations, word problems (20M05)

This page was built for publication: The Freeness Problem for Automaton Semigroups

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6520070&oldid=37992927"