Question
What is the minimum number of states required in a
Turing Machine to recognize the language L = { aⁿbⁿ | n ≥ 1 }?Solution
A Turing Machine (TM) for L = { aⁿbⁿ | n ≥ 1 } needs at least four states: 1. Initial state to scan ‘a’ 2. Intermediate state to replace ‘a’ and find ‘b’ 3. State to match ‘b’ with ‘a’ 4. Final accepting state
The Daughter cells produced after mitosis will have ___________ number of chromosomes as original cells.
Small plant may suffer from deficient oxygen when covered with densely packed snow due to which of the following condition?
During seed development, the phase involving dry matter accumulation is called:
Flavor of lemon grass is due to
Serious damage due to shoot and fruit borer is in:
Tillage results in
Water held by surface tension is called
What does the law of demand state in agricultural economics?
The ability to exert influence is called as.....................?
Green manure crop suitable for alkaline and water logged soil is
Relevant for Exams:
