Can A Regular Language Be Finite?
Can A Regular Language Be Finite? 4 Answers. A language is regular == A language can be expressed by a Regular Expression == A language can be expressed by a finite automata. Your example is indeed a regular language. A finite language is what you would expect it to be, a language that can be