A deterministic longest-prefix rewriting system is a string-rewriting system such that there are no rewriting rules X → Y, X → Z with Y ≠ 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.

Keywords:prefix rewriting, term rewriting, object-oriented data system, information system, consistency verification, ontology of a data model.