WS1S Solver: Project Structure

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 3 of 4

Finite Automata: Regular Expressions and Deterministic Finite Automaton

Covers the conversion from finite automata to regular expressions and exercises on constructing deterministic finite automata.

Automata Theory: Basics and Theorems

Introduces the basics of automata theory and explores the theorems of regular languages.

Syntax Trees: Parse vs AST

Explains syntax trees, parse vs AST, while language syntax, AST classes, and grammar ambiguities.

Gossip Efficiency: Decentralized Systems

Explores gossip efficiency in decentralized systems, covering protocols, interaction needs, and bandwidth optimization, along with search algorithms and optimizations.

Stochastic Parsing: Probabilistic Approach

Covers Stochastic Context-Free Grammars, probabilistic parsing, and the estimation of probabilities.

LL(1) Parsing

Covers LL(1) parsing, formalization, automation, constraints, and parsing tables.

Finite State Machines: Basics and Design

Introduces finite state machines, covering basics, design, and practical applications like decoders and encoders.

CYK algorithm

Introduces the CYK algorithm for efficient syntactic analysis using chart parsing and discusses its complexity and bottom-up parsing technique.

Introduction to Grammars

Introduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.

Syntactic Parsing and Graph2Graph Transformers

Covers syntactic parsing, dependency grammar, and graph-based neural network parsing.