Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with $n$ states, the average complexity of Moore's state minimization algorithm is in $\mathcal{O}(n \log n)$. Moreover this bound is tight in the case of unary automata.
['Frédérique Bassino', 'Julien David', 'Cyril Nicaud']
I am writing a research paper on a idea On the Average Complexity of Moore's State Minimization Algorithm
[{"from": "human", "value": "I am writing a research paper on a idea On the Average Complexity of Moore's State Minimization Algorithm"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with $n$ states, the average complexity of Moore's state minimization algorithm is in $\\mathcal{O}(n \\log n)$. Moreover this bound is tight in the case of unary automata."}]