Modal functions for concise definition of state machines and products (Q1183435): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q589305 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Leon Livovschi / rank | |||
Normal rank |
Revision as of 12:49, 16 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modal functions for concise definition of state machines and products |
scientific article |
Statements
Modal functions for concise definition of state machines and products (English)
0 references
28 June 1992
0 references
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.
0 references
finite automata
0 references
recursive functions
0 references