Regularity of Weak SolutionsExplores elliptic PDEs, weak solutions, regularity, and strong solutions, with a focus on classical solutions and proof techniques.
Finite Automata: BasicsIntroduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
CYK algorithmIntroduces the CYK algorithm for efficient syntactic analysis using chart parsing and discusses its complexity and bottom-up parsing technique.
Parsing: CYK AlgorithmExplores formal grammars, parsing algorithms, CYK algorithm efficiency, and syntactic correctness in Natural Language Processing.
From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Introduction to GrammarsIntroduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.
