- Related Questions & Answers
- Design a TM which recognizes palindromes over = {a, b}
- Construct a TM for the language L= {ww : w ∈ {0,1}}
- Construct DFA with Σ= {0,1} accepts all strings with 0.
- Construct Pushdown Automata for all length palindromes
- Design a TM that perform right shift over ∑ = {0, 1}
- Construct a DFA recognizing the language {x | the number of 1's is divisible by 2, and 0'sby 3} over an alphabet ∑={0,1}
- Construct a PDA that accepts (a,b)* language but not contain bbbb?
- Construct a TM recognizing strings of the form an bn cn| n≥1 over = {a, b, c}
- Construct a TM performing multiplication of two unary numbers
- Construct a Turing Machine for language L = {ww | w ∈ {0,1}}
- Construct a TM for adding 1 to a binary natural number?
- Design a TM that increments a binary number by 1
- C Program to construct a DFA which accepts L = {aN | N ≥ 1}
- Maximum even length sub-string that is permutation of a palindrome in C++
- Set the types of files that the server accepts in HTML

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

A Turing machine (TM) is a 7-tuple (Q, ∑, Γ, δ, q0, qaccept , qreject).

Where,

Q is a finite set of states.

∑ is the input alphabet that does not contain the blank symbol t.

Γ is the tape alphabet, where t ∈ Γ and ∑ ⊆ Γ.

δ: (Q × Γ) → (Q × Γ × {L, R}) is the transition function.

q0 ∈ Q is the start state.

qaccept ∈ Q is the accept state.

qreject ∈ Q is the reject state, where qreject ≠ qaccept.

**For accepting even-length palindrome over the alphabet {0,1},** follow the steps given below −

Match the first and last element and erase them and go on doing the same. Once we reach epsilon without any mismatch then the string is even-length palindrome.

For an even-length palindrome a TM is defined after the machine runs and erases the first and last element without encountering a mismatch. Later on the turing machine accepts the string and the string is even-length palindrome.

Let the string be −

110011

Then, we can encounter three cases, which are as follows −

**Case 1** − If starting and ending matches and then erase the first and last one

After erase − 1001

**Case 2** − If starting and ending matches and then erase the first and last one

After erase− 00

**Case 3** − If starting and ending matches and then erase the first and last zero

After erase remains − epsilon

This is a Turing machine constructed which accepts an even-length palindrome.

The schematic diagram for TM accepting the even-palindrome is as follows −

Advertisements