scientific article; zbMATH DE number 3581614

From MaRDI portal
Publication:4151160





The author gives a concise account of a class of flowcharts called F-charts. He observes that they may be employed to give what are essentially characterizations of the finite sequential machines of E. F. Moore on the one hand and the family of finite automata on the other. ``The significance \(\dots\) is that it permits us to use the methods of analysis employed for flowchart schemes (for) \(\dots\) Moore machines and finite automata. The author sees this as achieving a helpful unification of finite automata and controlled memory machines. For the entire collection see [Zbl 0351.00017].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4151160)