OurBigBook About$ Donate
 Sign in Sign up

Moore machine (s+=F(s,a), z=G(s))

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Formal language theory Finite-state machine
2026-10-25  0 By others on same topic  0 Discussions Create my own version
A Moore machine is a finite-state machine whose output depends only on the current state. In a clocked implementation, a state entered at a clock edge determines the following period's output. Specifying an initial state is necessary to define startup behavior.

 Ancestors (6)

  1. Finite-state machine
  2. Formal language theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Moore machine
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof resit / 3 / d / Solution
  • Synchronous pulse detector with two-zero rearming

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook