Syntactic sensitive complexity for symbol-free sequence
Cheng-Yuan Liou, Bo-Shiang Huang, Daw-Ran Liou, Alex A. Simak

TL;DR
This paper introduces a syntactic complexity measure based on L-systems to analyze text sequences' structure, applying it to anomaly detection in data transmission.
Contribution
It proposes a novel complexity measure for text sequences using L-systems, enhancing anomaly detection methods.
Findings
Effective in identifying anomalies in data transmission
Provides a structural complexity metric for text sequences
Demonstrates applicability to real-world data
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Fractal and DNA sequence analysis · Cellular Automata and Applications
