Ask Question
22 August, 08:51

If a regular language is empty then we denote it like L=? (fi).

True

False

+4
Answers (1)
  1. 22 August, 12:09
    0
    The answer to this question is False.

    Explanation:

    The answer is false because an Empty language is represented by ∅ (phi). Since all finite languages are regular hence the empty language is also a regular language. A regular language is a language which can be represented by regular expressions it is also called formal language.
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “If a regular language is empty then we denote it like L=? (fi). True False ...” in 📙 Computers & Technology if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers