Zobrazeno 1 - 1
of 1
pro vyhledávání: '"20F10 20F65 20M05 20M30 68Q17 68Q45"'
We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable by giving a reduction from Post's Correspondence Problem. This construction seems to be quite versatile and we also immediately obtain that the prob
Externí odkaz:
http://arxiv.org/abs/2402.01372
