Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  construct regular languages L n , n ≥ 1, such that any NFA recognizing L n  needs Ω(nsc(Ln) .√nsc(Ln)) transitions where nsc(L n ) is the nondeterministic state complexity of L n . Also,  study trade-offs beten the number of states and the number of transitions of an NFA.  show that adding one additional state can result in significant reductions in the number of transitions and that there exist regular languages L n , n ≥ 2, where the transition minimal NFA for L n  has more than c .nsc(L n ) states, for some constant c > 1.
['Michael Domaratzki', 'Kai Salomaa']
I am writing a research paper on a idea Lower bounds for the transition complexity of NFAs
[{"from": "human", "value": "I am writing a research paper on a idea Lower bounds for the transition complexity of NFAs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  construct regular languages L n , n \u2265 1, such that any NFA recognizing L n  needs \u03a9(nsc(Ln) .\u221ansc(Ln)) transitions where nsc(L n ) is the nondeterministic state complexity of L n . Also,  study trade-offs beten the number of states and the number of transitions of an NFA.  show that adding one additional state can result in significant reductions in the number of transitions and that there exist regular languages L n , n \u2265 2, where the transition minimal NFA for L n  has more than c .nsc(L n ) states, for some constant c > 1."}]