Automata theory

Related lectures (30)

Page 1 of 3

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

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

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

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

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

Covers finite state machines, their types, structures, and practical applications in digital systems.

Provides an overview of finite state machines, covering their design, analysis, and practical applications in digital systems.

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

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

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