Construct a Turing machine for L = {aibjck | i>j>k; k ≥ 1}

Here we will see how to make a Turing machine for language L = {AiBjCk | i > j > k; k ≥ 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 = aaaaaabbbbccc, The Turing machine will accept it.

To solve this, we will use this approach. Firstly compare two elements by making A and D as a single element, after that comparing A and D if count of C is greater than |(A, D)|, then the string will not be accepted, if |D| > |A|, then this is not accepted, otherwise it will be accepted.

State Transition Diagram

Arnab Chakraborty

Published on 03-Jan-2020 11:25:46

• 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; i ≥ 1}
• Construct a Turing Machine for language L = {0n1n2n | n≥1}
• Construct a Turing Machine for L = {a^n b^n | n>=1}
• Construct Turing machine for L = {an bm a(n+m) - n,m≥1} in C++
• Construct a PDA for language L = {0n 1m2m3n | n>=1, m>=1}
• Construct a Turing Machine for language L = {wwr | w ∈ {0, 1}}
• Construct PDA for accepting L = {anb(2n) | n>=1} U {anbn | n>=1}
• Construct a Turing Machine for language L = {ww | w ∈ {0,1}}
• Construct PDA for L = {0n1m2(n+m) | m,n >=1}
• Construct Turing machine for subtraction
• Construct Turing machine for addition
• Maximize arr[j] – arr[i] + arr[l] – arr[k], such that i < j < k < l in C++
• C Program to construct a DFA which accepts L = {aN | N ≥ 1}
• Construct a DPDA for anb2n n ≥ 1 in TOC