Year-end Sale % OFF 
Abstract
Zeiger 1967 details a procedure for decomposing a finite automaton into a cascade of permutation-reset machines. Therein are several errors and an ambiguity in the steps for making next-state assignments in the machines of the cascade. Several of the necessary adjustments appeared in the errata published on page 471, Volume 11, of this journal. The present work suggests further modifications, subsuming some of those which appeared earlier.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
