Glushkov algebras and clone theory
DOI10.1023/B:CASA.0000003501.97990.E5zbMATH Open1091.68072MaRDI QIDQ2487910FDOQ2487910
Authors: Yanyan Li 
Publication date: 12 August 2005
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Recommendations
- Issues of algorithmics and Glushkov's systems of algorithmic algebras
- Investigation of the structure of clones and related algebras of finitary functions, selected problems in the theory of varieties.
- scientific article; zbMATH DE number 4123792
- Algebraic algorithmics: Theory and applications
- Algebraic-algorithmic means for designing knowledge of object domains
clonealgebra of programsalgebraic algorithmicsiteration and recursionparadigms and tools of programming
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65) Applications of universal algebra in computer science (08A70)
Cited In (8)
- Peculiarities of the parallel sorting algorithm with rank formation
- Algebraic-algorithmic means for designing knowledge of object domains
- Galois theory for clones and superclones
- Cloning in C*-Algebras
- Formalization of the object classification algorithm
- Algebraic algorithmics: Theory and applications
- Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics
- Transformational reducibility and synthesis of algorithms and programs of symbolic processing
This page was built for publication: Glushkov algebras and clone theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487910)
