Transformational reducibility and synthesis of algorithms and programs of symbolic processing

DOI10.1007/S10559-006-0114-3MaRDI QIDQ2371752zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 5 July 2007

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-006-0114-3

zbMATH Keywords

algebras of algorithmsobject-oriented environmentregular schemessynthesis of algorithms and programssystems of Glushkov algorithmic algebras

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) General topics in the theory of algorithms (68W01)

Cites work

• Glushkov algebras and clone theory
• scientific article; zbMATH DE number 3831304 (Why is no real title available?)
• scientific article; zbMATH DE number 3782356 (Why is no real title available?)
• scientific article; zbMATH DE number 2104622 (Why is no real title available?)

Cited in

(4)

• Structural models of algorithms in problems of applied programming. I: Formal algorithmic structures
• A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG
• Transformation of algorithms written in the form of composition schemes
• Formalization of the object classification algorithm

This page was built for publication: Transformational reducibility and synthesis of algorithms and programs of symbolic processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371752)