Finite-State Machines

Christian Posthoff and Bernd Steinbach
Additional contact information
Christian Posthoff: The University of The West Indies
Bernd Steinbach: Freiberg University of Technology

Chapter Chapter 8 in Logic Functions and Equations, 2004, pp 337-373 from Springer

Abstract: Abstract A finite-state machine is a mathematical model of a special type of systems. One of the possible practical implementations of finite-state machines are sequential circuits. We study first sequential circuits, and then we generalize these concepts to finite-state machines.

Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4020-2938-7_8

Ordering information: This item can be ordered from
http://www.springer.com/9781402029387

DOI: 10.1007/978-1-4020-2938-7_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().