Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q220283 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Anatoly V. Anisimov / rank | |||
Normal rank | |||
Revision as of 23:37, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalences and transformations of regular systems - applications to recursive program schemes and grammars |
scientific article |
Statements
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (English)
0 references
1986
0 references
The paper presents a unified theory of recursive systems defined by means of recursive definitions. Recursive program schemes and context-free grammars are considered as main examples of such systems. The equivalences of regular systems associated with solutions of recursive equations are systematically investigated and characterized in terms of system transformations by folding, unfolding and rewriting according to the equational algebraic laws. Correctness of introduced transformation rules is also proved.
0 references
regular systems of equations
0 references
recursive systems
0 references
recursive definitions
0 references
Recursive program schemes
0 references
context-free grammars
0 references
unfolding
0 references
rewriting
0 references
