THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE (Q5410736)
From MaRDI portal
scientific article; zbMATH DE number 6286466
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE |
scientific article; zbMATH DE number 6286466 |
Statements
THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE (English)
0 references
17 April 2014
0 references
Mealy automata
0 references
automaton semigroups
0 references
Wang tilings
0 references
finiteness problem
0 references
cellular automata
0 references
undecidability
0 references
