11 ms·
Yes, all finite languages are regular. Specifically, you can construct a finite automata to represent it.
by nahumfarchi 2y ago
Yes, all finite languages are regular.
Specifically, you can construct a finite automata to represent it.
loading thread…