Info
Warning
Danger

Study Resources (Algebra)

Let an "infinite automata" be defined similarly to finite automata, but where the state set Q is no longer restricted to be finite. Characterize precisely the class of languages accepted by deterministic infinite automata. Is the characterization any different for non-deterministic infinite automata?  .
3 Views
View Answer