Login to filter by course Login to filter by course Reset
Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Covers the basics of Turing machines, including states, tape manipulation, and problem-solving capabilities.
Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Explores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.
Explores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.
Covers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.
Explores Finite State Machines (FSMs) in digital system design, covering Mealy and Moore FSMs, state diagrams, VHDL implementation, and state encoding.
Explores time-determinator model checking, U-Pool scheduling, worst-case execution time analysis, and statistical model checking for cyber-physical systems.
