Syntactic sensitive complexity for symbol-free sequence

2013/07/01 by Cheng-Yuan Liou, Cheng‐Yuan Liou, Bo-Shiang Huang +6
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #Artificial Intelligence (cs.AI) #Cellular Automata and Applications #FOS: Computer and information sciences #Fractal and DNA sequence analysis #cs.AI

paper · pdf · doi:10.48550/arxiv.1307.0339

11 pages, 5 figures

openalex publication_date 2013/07/01 · arxiv created 2013/07/02 · arxiv updated 2013/07/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• SYNTAX: A computer program to compress a sequence and to estimate its information content
• Efficient Textual Representation of Structure
• Stringological sequence prediction II: Right-to-left automaticity and related complexity measures
• Finding Structure in Text, Genome and Other Symbolic Sequences
• Linear-Time Modeling of Linguistic Structure: An Order-Theoretic Perspective