I want to ask about this statement.
"there exist finite automata that have a cycle, but still only accept a finite language"
is it true this statement? please give me a reason?
Thank you
2026-03-25 09:33:34.1774431214
Finite automata
63 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
HINT: The empty language is finite.