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