Computer Science Punjab PMS Paper II Syllabus
PAPER II Total Marks:100 SECTION- A 1. Theory of Automata and Formal Languages. Finite State Models: Language definitions preliminaries, Regular expressions/Regular languages, Finite automatas (FAs), Transition graphs (TGs),NF As, kleene’s theorem, Transducers (automata with output), Pumping lemma and non regular language Grammars and PDA: Context free grammars, Derivations, derivation trees and ambiguity, Simplifying CFLs ,…