Wednesday, 7 November 2012

Theory Of Computation ( TOC ) Notes According to RGPV

This blog contains following topic in very easy language according to RGPV syllabus.

TOPICS:
                    *  Finite Automata, DFA and NDFA Theory

                    *  Trasition System and Transition Table

                    *  NDFA to DFA Conversion

                    *  Minimization of DFA

                    *  Mealy And  Moore Machine And Their Conversions

                    *  Minimization of DFA using Myhill-Neurode Theorem

                     *  Two -Way Finite Automata

                     *  Grammar & Types of Grammar
                     *  Grammar to Language Conversion
                     *  Language to Grammar Conversion
                     *  Regular Grammar
                     *  Finite Automata Corresponding to Regular Expression
                     *  Regular Expression Corresponding to Finite Automata
                     *  Finite Automata containing Empty ( ^ ) Moves

  

2 comments: