News
Bengaluru, 27th March 2026: The Department of Information Science and Engineering at the Faculty of Engineering and Technology, JAIN Global Campus hosted an intensive two-day academic forum on Formal Languages and Automata (FLA) on 25th and 26th March 2026. Led by Prof Rajeev Bilagi, an experienced faculty member in computational theory, the sessions were designed to demystify complex theoretical frameworks and enhance students' problem-solving capabilities.
The primary objective of the lecture series was to bridge the gap between abstract mathematical concepts and their practical applications in computer science, specifically in areas such as compiler design and algorithm optimisation.
The first day of the forum established the foundational mechanics of automata and regular languages. Prof Bilagi guided students through operations on strings, transition diagrams, and the nuanced distinctions between Deterministic Finite Automata (DFA) and Non-Deterministic Finite Automata (NFA). The session focused heavily on analytical problem-solving, exploring DFA design, mod-k problems, and DFA minimisation through practical sequence recognition exercises.
Building on these fundamentals, the second day advanced into complex structural grammar. The curriculum covered Regular Expressions, the Pumping Lemma, and Chomsky Classification. Students were instructed on the mechanics of Context-Free Grammars (CFG), including derivations, parse trees, and ambiguity resolution. By utilising application-based examples such as grammar design for balanced parentheses and arithmetic expressions the session ensured high-level conceptual clarity.
By grounding rigorous computational theory in practical learning, the two-day lecture series significantly strengthened the cohort's analytical and problem-solving skills. The Department of Information Science and Engineering continues to prioritise specialised academic engagements that equip students with the robust theoretical foundation required to excel in advanced computing and software engineering.