- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Here we will see how to make a Turing machine for language L = {AiBjCk | i < j < k; i ≥ 1}. So this represents a kind of language where we will use only three characters A, B and C. The w is a string. So if w = AABBBBCCCCC, The Turing machine will accept it.

To solve this, we will use this approach. Firstly compare two elements as a single element, after that comparing the single element if |first| > |(Second, Third)|, and |Second| > |Third|, then it will be accepted. Now if |Third| > |(First, Second)| and |First| > |Second|, then it will be accepted, otherwise not accepted.

- Related Questions & Answers
- Construct a Turing machine for L = {aibjck | i*j = k; i, j, k ≥ 1}
- Construct a Turing machine for L = {aibjck | i>j>k; k ≥ 1}
- Construct a Turing Machine for language L = {0n1n2n | n≥1}
- Maximize arr[j] – arr[i] + arr[l] – arr[k], such that i < j < k < l in C++
- Construct Turing machine for L = {an bm a(n+m) - n,m≥1} in C++
- Find maximum sum of triplets in an array such than i < j < k and a[i] < a[j] < a[k] in C++
- Find maximum sum of triplets in an array such than i < j < k and a[i] < a[j] < a[k] in Python
- Construct a Turing Machine for language L = {wwr | w ∈ {0, 1}}
- Construct a Turing Machine for L = {a^n b^n | n>=1}
- Construct a Turing Machine for language L = {ww | w ∈ {0,1}}
- Count the triplets such that A[i] < B[j] < C[k] in C++
- Construct Turing machine for subtraction
- Construct Turing machine for addition
- Rearrange array such that arr[i] >= arr[j] if i is even and arr[i]<=arr[j] if i is odd and j < i in C++
- Program to find a triplet nums[i] < nums[k] < nums[j] from a list nums in C++

Advertisements