Skip to main content

Posts

Showing posts from August, 2013

Design a TM(Turing Machine) , L={a^nb^n | n>=1}

Design View: By JFLAP Software Concept :  aaabbb Case1: XaaYbb Case2:XXaYYb Case3:XXXYYY Case 1: Read first 'a' and replace it by 'X' Then read first 'b' and replace it as 'Y' What i am doing is .....Meaning of a^n b^n is " Equal no: of a's must followed by equal no: of b's " In Case 1 : I read first 'a' and First 'b'. Before reading Second 'b'....Should read Second 'a' .... Then continue the steps.....Finally 'B' reads....Machine will stop... Transitions concept will continue ......

Turing Machine-Today's Lecture Note

-Alan turing. -Language: Recursively Enumerable Language -Unrestricted Grammar (Why because there is no restriction for data reading .... Read data from Either Left or right side) - Input Tape:        ----------- B B  <string divided and keep in each cells> B B --------------- Finite Control Use "Tape head" to read  at a time one letter from input-tape cell. - Formal Definition M=(Q,Sigma,Toe,Delta,q0,B,F)                // 7 tuples or 7 elements...that we need to develop a TM Delta maps from Delta: Q X Toe -> Q X Toe X {L,R,S} Movements are L(Left),R(Right),S(Stationary)