Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a finite word $w$ of length $n$ and a class of finite automata $\mathcal A$,  study the Kolmogorov structure function $h_w$ for automatic complexity restricted to $\mathcal A$.  propose an approach to computational statistics based on the minimum $p$-value of $h_w(m)$ over $0\le m\le n$. When $\mathcal A$ is the class of all finite automata  give some upper bounds for $h_w$. When $\mathcal A$ consists of automata that detect several success runs in $w$,  give efficient algorithms to compute $h_w$. When $\mathcal A$ consists of automata that detect one success run,  moreover give an efficient algorithm to compute the $p$-values.
['Bjørn Kjos-Hanssen']
I am writing a research paper on a idea Kolmogorov structure functions for automatic complexity in computational statistics
[{"from": "human", "value": "I am writing a research paper on a idea Kolmogorov structure functions for automatic complexity in computational statistics"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a finite word $w$ of length $n$ and a class of finite automata $\\mathcal A$,  study the Kolmogorov structure function $h_w$ for automatic complexity restricted to $\\mathcal A$.  propose an approach to computational statistics based on the minimum $p$-value of $h_w(m)$ over $0\\le m\\le n$. When $\\mathcal A$ is the class of all finite automata  give some upper bounds for $h_w$. When $\\mathcal A$ consists of automata that detect several success runs in $w$,  give efficient algorithms to compute $h_w$. When $\\mathcal A$ consists of automata that detect one success run,  moreover give an efficient algorithm to compute the $p$-values."}]