COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Non regular
|
|
|
DFA-regular
|
|
|
Non-finite
|
|
|
None of the mentioned
|
Detailed explanation-1: -Any RegEx can be represented by an NFA or a DFA.
Detailed explanation-2: -Concatenation. If L1 and L2 are languages, then the concatenation of the two languages, L = L1 · L2, is the set of all strings of the form x1x2 where x1 ∈ L1 and x2 ∈ L2. Theorem If L1 and L2 are regular languages, then the new language L = L1 · L2 is regular.
Detailed explanation-3: -Remark 2: Since a language is regular if and only if it is accepted by some NFA, the complement of a regular language is also regular. Langauges are sets. Therefore all the properties of sets are inherited by languages.
Detailed explanation-4: -A deterministic finite automaton (or. DFA) is a quintuple D = (Q, , , q0, F), where. • is a finite input alphabet; • Q is a finite set of states; • F is a subset of Q of final (or accepting) states; • q0 ∈ Q is the start state (or initial state); • is the transition function, a function : Q × → Q.