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
- Argentina recently banned which of the following for minors?
By how much is AI projected to raise cross-border trade by 2040 according to the WTO’s 2025 World Trade Report?
Who won the Best Director award at the 70th Filmfare Awards 2025?
Recently Competition Commission of India (CCI) imposed a penalty of Rs 1,337.76 crore on which global tech firm for allegedly misusing its dominant posi...
Which fintech platform is going to invest approximately Rs 100 crore in Gujarat International Finance Tec-City (GIFT City) for the development of a Glob...
Paul-Henri Sandaogo Damiba, has been declared President of Burkina Faso. What is the capital of Burkina Faso?
- Who became the second-oldest player to make an ODI debut for India?
As per Economic Survey 2025–26, while Census 2011 estimates India’s urban population at 31%, alternative estimates using the DEGURBA methodology sug...
Who won Booker Prize 2021 for the book “The Promise”?
Consider the following statements about Swarved Mahamandir:
1. Prime Minister recently inaugurated the world's largest meditation cen...
Relevant for Exams:
