%0 Conference Paper %1 Dunay:1994:rliGP %A Dunay, B. D. %A Petry, F. E. %A Buckles, W. P %B Proceedings of the 1994 IEEE World Congress on Computational Intelligence %C Orlando, Florida, USA %D 1994 %I IEEE Press %K algorithms, genetic programming %P 396--400 %T Regular language induction with genetic programming

@inproceedings{Dunay:1994:rliGP, added-at = {2008-06-19T17:35:00.000+0200}, address = {Orlando, Florida, USA}, author = {Dunay, B. D. and Petry, F. E. and Buckles, W. P}, biburl = {https://www.bibsonomy.org/bibtex/22c56ef0805ff6406aaaa2fe939772164/brazovayeye}, booktitle = {Proceedings of the 1994 IEEE World Congress on Computational Intelligence}, interhash = {889b8dad52be91575637586a1cb87ced}, intrahash = {2c56ef0805ff6406aaaa2fe939772164}, keywords = {algorithms, genetic programming}, month = {27-29 June}, notes = {Considers two classes of regular language (NB series and Tomita) which can be recognised or accpeted by deterministic finite automata (Finite state machines). Can translate from DFA to tree structure. Trees are not executable programs but represent languages. crossover on trees defined. GP able to define a language given examples of it. Works on simplier examples but has difficulties with 8b, 9b, 10b and TL5.}, pages = {396--400}, publisher = {IEEE Press}, size = {5 pages}, timestamp = {2008-06-19T17:38:59.000+0200}, title = {Regular language induction with genetic programming}, year = 1994 }