Finite State Machines: Implementation and Subsumption Architecture

Related lectures (30)

Page 1 of 3

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

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

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

Explores hierarchical control concepts in robotics, including switching, prioritizing, and information chains, to achieve complex robot behaviors.

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

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

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

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

Explores synchronous logic circuits, modeling techniques, state minimization, and finite-state machine optimization for area reduction.

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