LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
|
|
|
u-1v-1
|
|
|
v-1
|
|
|
u-1
|
Detailed explanation-1: -2. Let u=’1101’, v=’0001’, then uv=11010001 and vu= 00011101. Using the given information what is the identity element for the string? Explanation: Identity relation: w = w = w, thus the one satisfying the given relation will be the identity element.
Detailed explanation-2: -1 Answer. The best I can explain: Type 3 refers to Regular Languages which is accepted by a finite automaton.
Detailed explanation-3: -A DFA can be constructed from an NFA through a general process called “subset construction.” In this process, all sets of states generated by an NFA for any input are considered as states for the DFA. Subset construction is a process for converting any NFA into a DFA and thus is applicable to string matching.
Detailed explanation-4: -6. String X is accepted by finite automata if . Explanation: If automata starts with starting state and after finite moves if reaches to final step then it called accepted.
Detailed explanation-5: -Explanation : The given DFA accepts all the binary strings such that they are divisible by 3 and 2. Thus, it can be said that it also accepts all the strings which is divisible by 6.