Syntactic sensitive complexity for symbol-free sequence

Abstract

This work uses the L-system to construct a tree structure for the text sequence and derives its complexity. It serves as a measure of structural complexity of the text. It is applied to anomaly detection in data transmission.

Tasks

Reproductions