If R is regular language and Q is any language (regular/ non-regular), then Pref( _______in _______) is regular.
Select correct option:
Q,Q
Q,R
R,Q
R,R
There _________ way(s) to decide whether an FA accepts a finite language or an infinite.
Select correct option:
are no
are so many
at most one
None of the given options
Using Myhill Nerode theorem we partition sigma star into distinct __________.
Select correct option:
objects
classes
instances
Set of all palindromes over {a,b} is:
Select correct option:
Regular
Regular and finite
Regular and infinite
Non-regular
For a machine with N number of states, the total number of strings to be tested, defined over an alphabet of m letters, is _____________.
Select correct option:
Nm +Nm+1+ N m+2 +… + N2m-1
mN +mN+1+ mN+2 +… +m2N-1
Nm
mN
In the context of Myhill Nerode theorem, for even-even language sigma star can be partitioned into __________ number of classes.
Select correct option:
3
4
5
If an effectively solvable problem has answer in yes or no, then this solution is called _________.
Select correct option:
Infinite problem
decision procedure
Finite solution
None of the given option
To examine whether a certain FA accepts any words, it is required to seek the paths _______ state.
Select correct option:
from final to initial
from initial to initial back
from final to back final
from initial to final
Incase of Myhill Nerode theorem, if a language L partitions sigma star into distinct classes and L is also regular then L generates ___________ number of classes.
Select correct option:
infinite
specified
finite
odd
For FA corresponding to (L1 ^?L2c ) u?( L1C ^ L2), the regular expression can be determined that defines the language accepted by this FA. From that regular expression one can determine whether this regular expression defines any word or not, the given step/steps can be done_________________.
Select correct option:
Is their any path from initial to final
Remove all *s from the regular expression
Separate the right part of + and the plus itself.
Select correct option:
Q,Q
Q,R
R,Q
R,R
There _________ way(s) to decide whether an FA accepts a finite language or an infinite.
Select correct option:
are no
are so many
at most one
None of the given options
Using Myhill Nerode theorem we partition sigma star into distinct __________.
Select correct option:
objects
classes
instances
Set of all palindromes over {a,b} is:
Select correct option:
Regular
Regular and finite
Regular and infinite
Non-regular
For a machine with N number of states, the total number of strings to be tested, defined over an alphabet of m letters, is _____________.
Select correct option:
Nm +Nm+1+ N m+2 +… + N2m-1
mN +mN+1+ mN+2 +… +m2N-1
Nm
mN
In the context of Myhill Nerode theorem, for even-even language sigma star can be partitioned into __________ number of classes.
Select correct option:
3
4
5
If an effectively solvable problem has answer in yes or no, then this solution is called _________.
Select correct option:
Infinite problem
decision procedure
Finite solution
None of the given option
To examine whether a certain FA accepts any words, it is required to seek the paths _______ state.
Select correct option:
from final to initial
from initial to initial back
from final to back final
from initial to final
Incase of Myhill Nerode theorem, if a language L partitions sigma star into distinct classes and L is also regular then L generates ___________ number of classes.
Select correct option:
infinite
specified
finite
odd
For FA corresponding to (L1 ^?L2c ) u?( L1C ^ L2), the regular expression can be determined that defines the language accepted by this FA. From that regular expression one can determine whether this regular expression defines any word or not, the given step/steps can be done_________________.
Select correct option:
Is their any path from initial to final
Remove all *s from the regular expression
Separate the right part of + and the plus itself.
0 comments
Post a Comment