Deterministic Semantic Token Algebra (DSTA): A Purely Mathematical Framework for Unique, Structure-Preserving Token Generation Across Computational Primitives

Read full text Summarise with VIRAT
Authors: Elizeu Almeida Prudente
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Provides the pure mathematical foundation for all token-based proposals in the TNSC series. Formalizes token generation as a homomorphism from a computational domain into a token space. Proves six axioms: determinism, uniqueness, compositionality, semantic proximity preservation, redundancy elimination, and universal applicability. Includes four formal theorems, three counterexamples, and a deterministic C++ implementation.

Fields of Study & Subjects

Logic programming and type systems semigroups and automata theory Algorithms and Data Compression

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
26 March 2026
Language
EN
Document type
Preprint