Question

all the regular languages can have one or more of the following description
1) DFA
2) NFA
3) e - NFA
4) regular expression
which of the following are correct ?
​

Answer 1

Answer:

may be 4) regular expression

Answer 2

Answer:

The final answer is 4) Regular Expression.

Step-by-step explanation:

Regular Languages is a language that generates strings which can be accepted by a DFA. A deterministic finite automata is a machine which gives us an output either accepting or not accepting. A string which is generated by a regular language is called a regular expression. If a generated expression is regular which means that there is a DFA thet gives an output for the expression then it means that the expression is regular henceforth the language is also regular. There can only be one DFA for a regular language. NFA and e-NFA may not be present however there can be more than one regular expression.

Regular Expression is the correct answer.

What is a DFA

https://brainly.in/question/13694552

Similar Problems

https://brainly.in/question/21474677

#SPJ2