**My research : prefix-free languages...**

**Files for download:**

Kleene Closure operation on prefix-free languages

2.state automata = 2.state prefix-free with state complexity 2.state solution

3.state automata = 3.state prefix-free with state complexity 3.state solution and his 3.state graph and Avarage value is 1,5

4.state automata = 4.state prefix-free with state complexity 4.state solution and his 4.state graph and Avarage value is 3,071

5.state automata = 5.state prefix-free with state complexity 5.state solution and his 5.state graph and Avarage value is 4,211

6.state automata = 6.state prefix-free with state complexity 6.state solution and his 6.state graph and Avarage value is 5,284

7.state automata = 7.state prefix-free with state complexity 7.state solution and his 7.state graph and Avarage value is 6,600

8.state automata = 8.state prefix-free with state complexity 8.state solution and his 8.state graph and Avarage value is xyz

9.state automata = 9.state prefix-free with state complexity 9.state solution and his 9.state graph and Avarage value is klm

Summary of results = Summary