Answer:
For any string, we use 
Explanation:
The pumping lemma says that for any string s in the language, with length greater than the pumping length p, we can write s = xyz with |xy| ≤ p, such that xyi z is also in the language for every i ≥ 0. For the given language, we can take p = 2.
Here are the cases:
- Consider any string a i b j c k in the language. If i = 1 or i > 2, we take
and y = a. If i = 1, we must have j = k and adding any number of a’s still preserves the membership in the language. For i > 2, all strings obtained by pumping y as defined above, have two or more a’s and hence are always in the language.
- For i = 2, we can take and y = aa. Since the strings obtained by pumping in this case always have an even number of a’s, they are all in the language.
- Finally, for the case i = 0, we take , and y = b if j > 0 and y = c otherwise. Since strings of the form b j c k are always in the language, we satisfy the conditions of the pumping lemma in this case as well.
Answer:
B.
Explanation:
A safety-critical system (SCS) or life-critical system is a system whose failure or malfunction may result in one (or more) of the following outcomes: death or serious injury to people. loss or severe damage to equipment/property.
Answer:
Explanation:
The turbine is modelled after the First Law of Thermodynamics:
The work done by the turbine is:
The properties of the water are obtained from property tables:
Inlet (Superheated Steam)
Outlet (Superheated Steam)
The work output is:
