Object-Oriented Data via Prefix Rewriting. Part I: Overview and Main Results
Abstract
A deterministic longest-prefix rewriting system is a string-rewriting system such that there are no rewriting rules $ X{\to}\,Y $ , $ X{\to}\,Z $ with $ Y\,{\neq}\,Z $ , and only the longest prefixes of words are subject to rewriting. For such a system, analogs of some concepts related to object-oriented data systems are defined and studied: inheritance of classes and objects, instances of classes, class and instance attributes, conceptual dependence and consistency, conceptual scheme, types and subtypes, etc. Special attention is paid to the effective verification of various properties of the rewriting systems under consideration.
Fields of Study & Subjects
Web Application Security Vulnerabilities
Logic
programming
and type systems
Computability
AI Algorithms
Publication details
- Journal / source
- Siberian Mathematical Journal
- Publisher
- Pleiades Publishing Ltd
- Volume
- 67
- Issue
- 3
- Pages
- 531–547
- Publication date
- 1 May 2026
- Language
- EN