Undecidability and Finite Automata
Formal Languages and Automata Theory
2017-03-01 v2
Abstract
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to prove the undecidability of a related problem about k-automatic sets of rational numbers.
Cite
@article{arxiv.1702.01394,
title = {Undecidability and Finite Automata},
author = {Jörg Endrullis and Jeffrey Shallit and Tim Smith},
journal= {arXiv preprint arXiv:1702.01394},
year = {2017}
}