HeyJaredDiscovering AI with Dr Tilottama
Discovering AI with Dr. Tilottama is an educational channel dedicated to simplifying Artificial Intelligence, Machine Learning, Deep Learning, Computer Vision, Statistics, and emerging AI technologies for students, researchers, educators, and professionals.
- Indexed videos, last 90 days
- 14
- Latest publication
- Sep 28, 2026
- Audience
- ~503 subscribers
- Earliest in this view
- Jul 16, 2026
Latest videos
Lecture 12: Closure Properties of Languages - RL and CFL (opens the original)
Read excerpt
Understanding What Operations Preserve Context-Freeness The lecture explores the operations under which regular languages and context-free languages remain closed and those under which closure is not guaranteed. When two languages are combined using operations such as union, concatenation or intersection, does the resulting language retain the same properties? Understanding closure properties helps answer this fundamental question in Theory of Computation. This lecture explores the closure and n
Lecture11: Properties of Context-Free Languages: CNF & Pumping Lemma for CFL (opens the original)
Read excerpt
Understanding the properties of Context-Free Languages (CFLs) is essential to understanding the theoretical foundations of compiler design, parsing, and formal language theory. This lecture explores the fundamental properties of Context-Free Languages, beginning with Chomsky Normal Form (CNF) and the Pumping Lemma for CFLs. The session explains how a Context-Free Grammar can be transformed into a standard form without changing the language it generates. It then examines how the Pumping Lemma can
Lecture 10: Context-Free Grammars & Pushdown Automata (opens the original)
Read excerpt
How do we describe languages with recursion, nesting and matching structures? And how can a machine recognize them? In this session on Theory of Computation, we move beyond finite automata and introduce Context-Free Grammars (CFGs) and Pushdown Automata (PDAs). A CFG acts as a generator—it tells us how valid strings can be constructed using production rules. A PDA acts as a recognizer—it verifies whether a string belongs to a context-free language using finite-state control and an unbounded stac
Lecture L9: Introduction to Context Free Grammar (opens the original)
Read excerpt
Why do we need Context-Free Grammars when we already have Finite Automata? And why do CFGs still matter in the age of Large Language Models? This lecture introduces Context-Free Grammars (CFGs) by starting with a fundamental limitation of Regular Languages and Finite Automata: finite memory is not sufficient to recognize languages requiring unbounded counting, matching, or nesting. Using intuitive examples such as 0ⁿ1ⁿ, balanced parentheses, nested HTML/XML tags, and programming-language express
Data Analytics and Cyber Security: From Data-Driven Insights to Secure Digital Systems (opens the original)
Read excerpt
This featured talk on “Data Analytics and Cyber Security” was delivered as a Guest Speaker at a webinar organized by the ISACA Muscat Chapter on 30 March 2024. The session explores the intersection of Data Analytics and Cyber Security, highlighting how organizations can leverage data-driven approaches to identify patterns, detect anomalies, assess risks, and strengthen their cybersecurity posture. The talk brings together two increasingly interconnected disciplines: analytics for understanding a
Publishing over time
Last 90 days. Choose a month to open its work.
Recurring subjects
Named in the text we hold. One piece can cover several.
Audience
~503 subscribers
Measured Sep 19, 2026
Source's subscribers, not the number who saw an individual piece.
About this data
Counts cover the work we have indexed. Tone needs enough text and a confident classification. Excerpts and episode notes are not full articles or transcripts.
Identity or attribution wrong? Suggest a correction.