Modal functions for concise definition of state machines and products (Q1183435): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90011-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1976488570 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5730897 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5590815 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3241191 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hierarchies of Effective Descriptive Set Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3951547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4185809 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Application of model theoretic games to discrete linear orders and finite automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5525259 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5533181 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3769981 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5786041 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The varieties of arboreal experience / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computation on binary tree-networks / rank | |||
Normal rank |
Latest revision as of 15:47, 15 May 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
0 references