Accession Number : AD0673092
Title : DECOMPOSITION THEOREMS FOR FINITE SEQUENTIAL MACHINES.
Descriptive Note : Technical rept.,
Corporate Author : HEBREW UNIV JERUSALEM (ISRAEL)
Personal Author(s) : Magidor,M.
Report Date : FEB 1968
Pagination or Media Count : 40
Abstract : In this work we present a different proof of results by K. B. Krohn and J. L. Rhodes ((1)), and give a new result on the same lines. These authors proved that every function computed by a finite state machines can be constructed by 'elementary operations' on a set of 'prime functions.' By extending the scope of elementary operations, we show that all functions computed by finite machines are built from a single function. (Author)
Descriptors : (*MATHEMATICAL LOGIC, AUTOMATA), GROUPS(MATHEMATICS), SET THEORY, PERMUTATIONS, COUNTING METHODS, CODING, FUNCTIONS(MATHEMATICS), THEOREMS, ISRAEL
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE