DeepRead
Cover of Algebraic structure theory of sequential machines

Algebraic structure theory of sequential machines

Juris Hartmanis · 1966

Minds, machines and the future › Turing and computing history

#11,571 most recommended

About the book

This is a monograph on finite-state sequential machines, the abstract model of digital circuits and automata that have inputs, outputs and internal states. It treats these machines through the algebra of their state sets and transition structure, with the lattice of state partitions as its main tool. The central claim is that a sequential machine's structure is best understood algebraically, through partitions of its state set that are compatible with its transitions, rather than through a state-by-state description alone. The book, written by Hartmanis with Richard E. Stearns, argues that these partition pairs determine when a machine can be realized as a cascade or parallel interconnection of simpler machines. It builds on this to develop methods for decomposition, state assignment and analysing which machines can be built from which components.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

0242023202420252023 peak · 4
This bookAverage book in Turing and computing history

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1966
Editions known
none recorded at Open Library
Open Library
OL6802444W

Sequential machine theory

Explore in the mosaic

Read next: its neighbours on the mosaic