![](/img/cover-not-exists.png)
THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
GILLIBERT, PIERREVolume:
24
Language:
english
Journal:
International Journal of Algebra and Computation
DOI:
10.1142/S0218196714500015
Date:
February, 2014
File:
PDF, 203 KB
english, 2014