What is regular language in theory of computation along with suitable example?
Answers
Answered by
3
⚡⚡Here is your answer⚡⚡
If a and b are regular expression, ab (concatenation of a and b) is also ... For example, (a+b*)* and (a+b)* generate same language. ... Theory of Computation ...
Answered by
0
A regular language satisfies the following equivalent properties: it is the language of a regular expression (by the above definition) it is the language accepted by a nondeterministic finite automaton (NFA) it is the language accepted by a deterministic finite automaton (DFA) it can be generated by a regular grammar.
Similar questions