Modal functions for concise definition of state machines and products
A method is presented based on modal extension of the primitive recursive functions (MPR) to describe systems with complex control or large state sets. After the presentation (in section 2) of the definition of MPR functions and of their properties, a theorem is proved, showing that the class of MPR functions is equivalent to the class of Moore machines. Then, in section 3, it is shown that the different forms of automata products may be described in terms of MPR functions composition.
scientific article; zbMATH DE number 33292
scientific article