1959/09/01 by M. C. Paull, S.H. Unger · 3 citations
Computer Science · Engineering · Mathematics · #Petri Nets in System Modeling #Advanced Control Systems Optimization #Fault Detection and Control Systems #Row #Extension (predicate logic) #Table (database) #Simple (philosophy) #Mathematics #Algorithm #Function (biology) #Computer science #Arithmetic #Data mining
paper · doi:10.1109/tec.1959.5222697
openalex publication_date 1959/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26
Given a sequential switching function in the form of a flow table in which some of the entries are unspecified, the problem of reducing the number of rows in that flow table is extremely complex, and cannot, in general, be solved by any simple extension of the methods used for completely specified functions. An analysis of the problem is presented, and a partially enumerative solution is evolved. A rough indication of the efficiency of the given procedures may be obtained from the fact that these techniques have been successfully applied to approximately two dozen tables ranging up to about 15 rows. No solution required more than two hours.