ATC | VTU Syllabus | Turing Machine Design for Language of Even Palindromes in Theory of Computation
This lecture covers the design of a Turing machine for recognizing the language of even palindromes over the alphabet {a, b}*, including the explanation of its instantaneous description and operational details.
Master Computer Science Subjects
1.3K views • Nov 28, 2019
About this video
In Theory of computation, Turing machine is designed for language of even palindromes on {a,b}* and instantaneous description is also explained.
TM reads input from left to right. It reads the first character , replaces it by blank 'B' and moves to right to find last character and replaces it by blank 'B' if the character is same as first what it read. The procedure repeats till it finds only blank symbols.
TM reads input from left to right. It reads the first character , replaces it by blank 'B' and moves to right to find last character and replaces it by blank 'B' if the character is same as first what it read. The procedure repeats till it finds only blank symbols.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
1.3K
Duration
19:09
Published
Nov 28, 2019
User Reviews
3.7
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now