Beynon, Meurig (1978) On the structure of free finite state machines. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Preview

Text WRAP_Beynon_cs-rr-025.pdf - Published Version Download (857Kb) | Preview

Request Changes to record.

Abstract

As explained by Birkhoff and Lipson in [1], a finite state machine M (without outputs) can be considered as an algebra with two "phyla": S = set of states, I = input alphabet and a single operator: T : S x I -> S, the transitive function of M.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Sequential machine theory
Series Name:	Theory of Computation Report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	September 1978
Dates:	Date Event September 1978 ["eprint_fieldopt_dates_date_type_available" not defined]
Number:	Number 25
Number of Pages:	18
DOI:	CS-RR-025
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Access rights to Published version:	Open Access (Creative Commons)
Date of first compliant deposit:	1 August 2016
Date of first compliant Open Access:	1 August 2016

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads