Работы, цитирующие эту работу

Работ: 4

Работа: Separable Algorithmic Representations of Classical Systems and their Applications

1. One Question of the Theory of Numbered Groups

   N. Kh. Kasymov

   СтатьяComputability, Logic, AI AlgorithmsSiberian Mathematical Journal2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.004198

2. Negativity of effectively separable numberings of fields the finite characteristic

   N. Kh. Kasymov, N. R. Karimova, E. A. Khodzhamuratova

   СтатьяComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.007548

3. Finite logical specifications of effectively separable data models

   N. R. Karimova, N. Kh. Kasymov, S. K. Zhavliev

   СтатьяComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.008520

4. Finite Logical Specifications of Effectively Separable Data Models

   N. R. Karimova, N. Kh. Kasymov, S. K. Zhavliev

   СтатьяStatistical and Computational ModelingRussian Mathematics2025Цитирований: 0

   ABIABI:AkademIndex/openalex/2025.article.010841