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.
Explores Finite State Machines (FSMs) in digital system design, covering Mealy and Moore FSMs, state diagrams, VHDL implementation, and state encoding.
Covers the design of a Finite State Machine for a door lock system and explains the Moore FSM model with key validation and LED indicators.
Explores Arduino data acquisition, emphasizing global variables, race conditions, and state machines.
Covers the design of a KeyLock system in VHDL, focusing on the FSM implementation for key validation and LED indication.
Covers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.
Explores the theoretical properties and practical power of Recurrent Neural Networks, including their relationship to state machines and Turing completeness.
Covers the design and synthesis of Finite State Machines, including completeness, consistency, ghost states, and transition tables.
Covers the design and synthesis of Finite State Machines, emphasizing completeness, consistency, and ghost states.
