Finite State Machines: Medvedev vs. Moore vs. Mealy

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 3 of 3

Elevator Logic Systems

Explores elevator logic systems, including behavior analysis, logic functions, SR-Latches, and Set-Reset Latches.

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.

Regular Expressions (Recap)

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

Arbiter FSM & FPGA Implementation

Covers the design of an Arbiter FSM in VHDL for digital system design, emphasizing access timing management.

Boolean Algebra: Properties and Theorems

Covers the properties and theorems of Boolean algebra in logic systems.

Boolean Algebra: Properties and Optimization

Explores Boolean algebra properties and optimization techniques using Karnaugh diagrams and De Morgan's theorems.

Transistor Logic Gates: TTL vs CMOS

Compares BJT and MOSFET in logic systems, focusing on TTL vs CMOS technologies.

Logic Gates and Hazard Elimination

Explores logic gates, hazard elimination, ALUs, counters, and shift registers in semiconductor technology.

Finite Automata: Basics

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

Digital Systems Overview: Evolution and Fundamentals

Explores the evolution of digital systems, covering basics like Boolean algebra and logic gates, and emphasizes teamwork skills and professional vocabulary.