Syntactic sensitive complexity for symbol-free sequence
This work addresses anomaly detection in data transmission, but appears incremental as it applies an existing method (L-systems) to a new domain.
The paper tackles the problem of measuring structural complexity in text sequences by using L-systems to construct tree structures and derive complexity measures, and applies this to anomaly detection in data transmission, though no concrete numbers are provided.
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.