Issues of algorithmics and Glushkov's systems of algorithmic algebras

DOI10.1007/BF02666997zbMath0931.68054MaRDI QIDQ1288661

K. Appert

Publication date: 15 September 1999

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

zbMATH Keywords

algorithmic algebras

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (7)

Algebraic-algorithmic means for designing knowledge of object domains ⋮ Formalization of the object classification algorithm ⋮ Data based algorithmic algebra ⋮ Criteria of functional completeness for meta-algebras without assignments of logical constants ⋮ Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics ⋮ Formalization of interrelations between operators and data within the framework of an extended algebra of algorithms ⋮ Structural models of algorithms in problems of applied programming. II: Structural-algorithmic approach to software simulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal aspects of structured programming with goto statements
• Design of sequential sorting algorithms: Classification, transformation, synthesis
• Some mathematical and software tools for the development of special-purpose expert systems
• Functional completeness criteria in Dijkstra algebra
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: Issues of algorithmics and Glushkov's systems of algorithmic algebras