An injective assignment of abstract finite-state machine states to stored bit patterns. distinct states require at least binary storage elements. Encodings with unused patterns can simplify Boolean functions through don't-care conditions, but the implemented next-state equations determine what those unused patterns actually do.

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)

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