Lectures related to Regular Expressions to Automata

Covers the fundamentals of regular expressions and includes exercises on defining languages.

Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.

From Regular Expressions to Automata

Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.

Finite State Machines: Basics and Design

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

Logic Systems: Sequential and Combinatorial Circuits

Covers fundamental concepts of logic systems, including sequential and combinatorial circuits, state diagrams, and finite state machines.

Regular Expressions and Lexer Idea

Explores regular expressions, including their history, operators, lexical analysis, and manual construction of lexers.

Regular Expressions and Lexer Idea

Covers regular expressions, Kleene's contributions, logic, lexical analysis, and manual lexer construction.

Automata Theory: Basics and Theorems

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

Spelling Error Correction

Explores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.

Finite State Machines: Medvedev vs. Moore vs. Mealy

Compares Medvedev, Moore, and Mealy FSM models and their structures.

Logic Systems: Finite State Machines

Explores Boolean algebra, optimization, sequential systems, and finite state machines design.

Finite Automata: Regular Expressions and Deterministic Finite Automaton

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

Finite Automata: DFA to Regular Expression

Explains the transformation from a DFA to a Regular Expression and discusses important concepts in automata theory.

Finite Automata: Recap

Covers the fundamentals of finite automata and formal languages.

Graph Algorithms: Modeling and Traversal

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Lexicons, n-grams and Language Models

Explores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.

Synchronous Logic Circuits: Modeling and Optimization

Explores synchronous logic circuits, state-based modeling, optimization techniques, and finite-state machine state minimization.

Finite Automata: Recap and Determinization

Covers a recap on NFAs and introduces the determinization process.

Finite State Machines: Implementation and Subsumption Architecture

Explores finite state machines, subsumption architecture, obstacle avoidance, and robot kinematics in robotics.

Keylock in VHDL and on FPGA

Covers the design of a KeyLock system in VHDL, focusing on the FSM implementation for key validation and LED indication.