Category talk:Finite state automata

Clarification needed, What criteria does a language need to be included here.

Do Finite State Machines need to be translated into the language? Or is it the other way (Which means H🌍 and Text should count)? Do they need to accept arbitrary size FSMs or can there be a limit on how many states you can program? This Category is a mess of Joke Languages, Bounded Storage Machines and only a few being able to accept arbitrary Finite State Machines.

If it were up to me I'd say only languages that can simulate an arbitrary Finite State Machine should be allowed. So Bounded Program Sizes would disqualify a language so therefore Malbolge is disqualified. And Text and Deadfish "self-interpreter" would not count aswell.