Format Type: PDF, ePub
Read Online: 445
Finite State SystemsDFA, NDFA and there equivalence. Conversion of NDFA, DFA, DFA with E-Moves, Two-way Finite Automata, Finite Automata with output, Transformation of a Mealy Machine into a Moore Machine and their conversion, FSM properties and limitations.Regular ExpressionsArden's Theorem, Pumping Lemma and its applications, closure properties. Decision Algorithms of Regular Sets, Applications of regular expressions and finite Automata.GrammersInvention and evolution of Formal LanguagesPushdown AutomataAssociation of push down automata with context - free grammers.Post MachinesDefinitions and examplesProduction SystemsFundaments, PMT Systems, PCS, Markou AlgorithimTuring MachinesModel, Representation, Language Acceptability and design of Turing Machines. Nondeterministic, Composite, Integrated, Universal, Turing Machines, Limitations, Recursive and Recursively Enumerable Languages, functionsApplications and LimitationsLexical Analyzer, Text Editors, Searching, Conversion of regular expression into a DFA.