Theory Of Computation

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 ......

-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)

Difference between DFA & NFA DFA  means Deterministic Finite Automata .  From one state to another only one input symbol is using. NFA  means Non- Deterministic Finite Automata.  There may be more than one transition from one state to another using same symbol.

        My Old Google site:  Click (" https://sites.google.com/site/cse09506mesce/home ")          1) Computation is the sequence of steps performed by the computer.         2) Computation is the process of execution of an algorithm that involves take some inputs and apply some operation then will get some output. Output may be accepted or rejected based on the input string. In My point of view eg:        In neural network we having inputs,operation and outputs....Operation may be called as activation function. Finite Automata           The word automata  comes from greek word automata that means "self acting". self acting->Something is doing something by itself.           we will see the term Automata.  Automata-> is the study of abstract computing devices or machin...

https://sites.google.com/site/cse09506mesce/home

Theory Of Computation is a "theoretical computer science". Is a branch of computer science that deals with whether and how efficiently problems can be solvable on a computer.

I am sure....this time i will try to write one book about "Theory Of Computation".

Context-sensitive grammar Context-sensitive grammars are more general than context-free grammars but still orderly enough to be parsed by a linear bounded automaton. Linear bounded automaton In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA ) is a restricted form of nondeterministic Turing machine .