Modal functions for concise definition of state machines and products (Q1183435)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Modal functions for concise definition of state machines and products |
scientific article; zbMATH DE number 33292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modal functions for concise definition of state machines and products |
scientific article; zbMATH DE number 33292 |
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
0 references
0.8523921
0 references
0.82862014
0 references
0.8264181
0 references
0.8255279
0 references