Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Sequential Systems: Microcontrollers

Description

This lecture covers the understanding of sequential systems, focusing on state graph description and state machine design, with a practical solution using microcontrollers. It also delves into logical systems, truth tables, and a real-world example of controlling a drill movement. The presentation includes quizzes to identify system inputs and outputs, as well as the implementation of state machines with combinational systems. The lecture concludes with simulations, integrated circuit realizations, and a simpler solution using microcontrollers. A detailed program is provided for system computation and output activation using digital inputs. Throughout the lecture, the instructors emphasize the practical application of sequential systems in microcontroller-based projects.

Official source

Ontological neighbourhood

Logic

Classical logic: First-order logic

Related concepts (26)

Logical truth

Logical truth is one of the most fundamental concepts in logic. Broadly speaking, a logical truth is a statement which is true regardless of the truth or falsity of its constituent propositions. In other words, a logical truth is a statement which is not only true, but one which is true under all interpretations of its logical components (other than its logical constants). Thus, logical truths such as "if p, then p" can be considered tautologies.

Finite-state machine

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.

Moore machine

In the theory of computation, a Moore machine is a finite-state machine whose current output values are determined only by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. Like other finite state machines, in Moore machines, the input typically influences the next state. Thus the input may indirectly influence subsequent outputs, but not the current or immediate output. The Moore machine is named after Edward F.

Mealy machine

In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. This is in contrast to a Moore machine, whose output values are determined solely by its current state. A Mealy machine is a deterministic finite-state transducer: for each state and input, at most one transition is possible. The Mealy machine is named after George H. Mealy, who presented the concept in a 1955 paper, "A Method for Synthesizing Sequential Circuits".

Truth table

A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—which sets out the functional values of logical expressions on each of their functional arguments, that is, for each combination of values taken by their logical variables. In particular, truth tables can be used to show whether a propositional expression is true for all legitimate input values, that is, logically valid.

Related lectures (28)

Propositional Logic: Translations and Equivalences

Covers translating natural language to propositional logic and proving tautologies.

Introduction & Propositional Logic

Covers the basics of propositional logic, logical connectives, truth tables, and compound propositions.

Understanding Microcontrollers: Combinatorial Systems

Introduces the basics of combinational systems in microcontrollers, covering logical systems and truth tables.

Concept of Proof in Mathematics

Delves into the concept of proof in mathematics, emphasizing the importance of evidence and logical reasoning.

Propositional Logic: Basics and Applications