On the Equivalence of Finite-State Sequential Machine Models
From MaRDI portal
Publication:5547292
DOI10.1109/PGEC.1967.264614zbMath0163.18204OpenAlexW2085283726MaRDI QIDQ5547292
Publication date: 1967
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/pgec.1967.264614
Related Items (3)
Regular separable graphs of minimum order with given diameter ⋮ High density graphs for processor interconnection ⋮ One method for proving the impossibility of certain Moore graphs
This page was built for publication: On the Equivalence of Finite-State Sequential Machine Models