Turlough Neary. 2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets. In Giovanni Pighizzini, Cezar Câmpeanu, editors, Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings. Volume 10316 of Lecture Notes in Computer Science, pages 274-286, Springer, 2017. [doi]
@inproceedings{Neary17,
title = {2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets},
author = {Turlough Neary},
year = {2017},
doi = {10.1007/978-3-319-60252-3_22},
url = {https://doi.org/10.1007/978-3-319-60252-3_22},
researchr = {https://researchr.org/publication/Neary17},
cites = {0},
citedby = {0},
pages = {274-286},
booktitle = {Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings},
editor = {Giovanni Pighizzini and Cezar Câmpeanu},
volume = {10316},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-60252-3},
}