Official Bihar Engineering University examination question papers, marks distribution, and questions transcript. Available exam sessions: 2025, 2022, 2021, 2020, 2019, 2018.
Open BEU Connect Android app to solve any numerical or derive formulas step by step.
No paper transcript available.
Official BEU curriculum units & topics for this examination subject.
Unit 1.0: Introduction (5 hrs)
Alphabet, languages and grammars • Productions and derivation • Chomsky hierarchy of languages
Unit 2.0: Regular Languages and Finite Automata (9 hrs)
Regular expressions and languages • Deterministic finite automata (DFA) and equivalence with regular expressions • Nondeterministic finite automata (NFA) and equivalence with DFA • Regular grammars and equivalence with finite automata • Properties of regular languages • Pumping lemma for regular languages • Minimization of finite automata
Unit 3.0: Context-free Languages and Pushdown Automata (8 hrs)
Context-free grammars (CFG) and Context-free languages (CFL) • Chomsky and Greibach normal forms • Nondeterministic pushdown automata (PDA) and equivalence with CFG • Parse trees, ambiguity in CFG • Pumping lemma for context-free languages • Deterministic pushdown automata • Closure properties of CFLs
Unit 4.0: Context-sensitive Languages (5 hrs)
Context-sensitive grammars (CSG) and Context-sensitive languages • Linear bounded automata and equivalence with CSG
Unit 5.0: Turing Machines (8 hrs)
The basic model for Turing machines (TM) • Turing recognizable (Recursively enumerable) and Turing-decidable (recursive) languages • Closure properties • Variants of Turing machines • Nondeterministic TMs and equivalence with deterministic TMs • Unrestricted grammars and equivalence with Turing machines • TMs as enumerators