Are you worry about CS402 Current Final Term Paper 2022? So, do not worry, I have updated CS402 Current Final Paper 2022 on my website Raise For Success.
.png "CS402 Current Final Term Paper 2022")
Question No 1:
TM is more powerful than FSM because:
___ algorithm is used to determine whether a string is generated by the given CFG or not.
A non-terminal is said to be self-embedded, if in a given derivation of a word, it ever occur as a tree _____ of itself.
Left hand side of a production in Context Free Grammar (CFG) consists of _______.
In _____ there are finite set of states containing exactly one START state and some (may be none) HALT states that cause execution to terminate, when the HALT states are entered.
Which of the following regular expressions does not correspond to the language having all words (made up of a’s and b’s) with at least two a’s?
Which language will be accepted by the given Finite Automaton (FA)?
TM is more powerful than FSM because:
- The tape movement is confined to one direction
- It has no finite State control
- It has the capability to remember arbitrary long sentences of input symbols
- The tape movement is confined to more than one direction
___ algorithm is used to determine whether a string is generated by the given CFG or not.
- CNK
- CNM
- CYK
- CIK
A non-terminal is said to be self-embedded, if in a given derivation of a word, it ever occur as a tree _____ of itself.
- Ascendant
- Descendant Correct
- Top
- Bottom
Left hand side of a production in Context Free Grammar (CFG) consists of _______.
- More than one terminal
- One non-terminal
- Terminals and non-terminals
- One terminal
In _____ there are finite set of states containing exactly one START state and some (may be none) HALT states that cause execution to terminate, when the HALT states are entered.
- Turing Machine
- GTG
- Finite Automata
- TG
Which of the following regular expressions does not correspond to the language having all words (made up of a’s and b’s) with at least two a’s?
- (a+b)*a(a+b)*a(a+b)*
- (a+b) *a+b *a(a+b)*
- b*ab*a(a+b)
- b*ab*(a+b)*
Which language will be accepted by the given Finite Automaton (FA)?
- Having equal number of a’s and b’s
- It does not accept any language
- Having double a’s followed by double b’s
- Having one ‘a’ and bbb
Question No 9:
The structure below is called _____
S-> aAbB
A-> aSa
B->bSb
- RE
- CFG
- PDA
- TG
Question No 10:
Regular expressions _______ are not equivalent.
Regular expressions _______ are not equivalent.
- (ab)* and a*b*
- x(xx)* and (xx)*x
- x+ and x*x*
- x(x)* and (x)*x
Develop corresponding Context Free Grammar
(CFG) for the regular expression given below:
a(a+b)*b
a(a+b)*b
Question No 12:
By using Myhill theorem prove that the
following language is regular.
Language L of strings, defined over ∑ = {a,b} ending in a.
Question No 13:
Give table for output string if we run input string 1011 on the given mealy machine?
