Metrika članka

  • citati u SCindeksu: 0
  • citati u CrossRef-u:0
  • citati u Google Scholaru:[=>]
  • posete u poslednjih 30 dana:3
  • preuzimanja u poslednjih 30 dana:3
članak: 1 od 3  
Back povratak na rezultate
Godišnjak Pedagoškog fakulteta u Vranju
2016, br. 7, str. 79-89
jezik rada: engleski
vrsta rada: pregledni članak
objavljeno: 14/05/2016
doi: 10.5937/gufv1607079B
Pregled nekih mogućnosti korišćenja genetskih algoritama u teoriji automata
Univerzitet u Nišu, Učiteljski fakultet, Vranje

Sažetak

Jedno je sigurno - poreklo života je u prirodi, koja to najbolje zna. Genetski algoritmi (GA) su porodica algoritama koji koriste neku vrstu genetskih principa koji se nalaze u prirodi, u cilju rešavanja konkretnih računarskih problema. Genetski algoritmi su robusne i prilagodljive metode koje se pored ostalih oblasti primene mogu koristiti za rešavanje kombinatornih optimizacionih problema. Razlog je u tome što se genetski algoritmi mogu relativno lako prilagoditi specifičnim problemima. Automati su već izgrađivani evolutivnim tehnikama 60-ih godina prošlog veka od strane Fogela. On je stvorio 'evolutivno programiranje', što je bio prvi pokušaj da se izgradi jedan automat evolutivnim pristupom. Cilj ovog rada je bio da se dodatno demonstrira i prikaže mogućnost primene GA u teoriji automata.

Ključne reči

genetski algoritam; kombinatorijalna optimizacija; NP problemi; konačni automat; resetujuća reč; utrapljiva reč

Reference

Bogdanović, M. (2011) On Some Basic Concepts of Genetic Algorithms as a Meta-Heuristic Method for Solving of Optimization Problems. Journal of Software Engineering and Applications, 04(08): 482-486
Collins, R., Jefferson, D. (1991) Representations for artificial organisms. u: The First International Conference on Simulation of Adaptive Behavior, MIT Press, Proceedings of
Eppstein, D. (1990) Reset Sequences for Monotonic Automata. SIAM Journal on Computing, 19(3): 500-510
Fabera, V., Janes, V., Janesova, M. (2006) Automata Construct with Genetic Algorithm. u: 9th EUROMICRO Conference on Digital System Design (DSD'06), pp. 460-463
Fogel, L.J., Owens, A.J., Walsh, M.J. (1966) Artificial intelligence through simulated evolution. New York, itd: Wiley
Gecseg, F., Peak, I. (1972) Algebraic theory of automata. Budapest: Akadémiai Kiadó
Holland, J.H. (1975) Adaptation in natural and artificial Systems: an Introductory Analysis with Applications to Biology, Control, and ArtificialIntelligence. Ann Arbor: The University of Michigan Press
Kisielewicz, A., Kowalski, J., Szykuła, M. (2013) A Fast Algorithm Finding the Shortest Reset Words. Lecture Notes in Computer Science, str. 182-196
Lai, Z., Cheung, S.c., Jiang, Y. (2006) Dynamic Model Learning Using Genetic Algorithm under Adaptive Model Checking Framework. u: Sixth International Conference on Quality Software (QSIC'06), pp. 410-417
Lucas, S.M., Reynolds, T.J. (2005) Learning deterministic finite automata with a smart state labeling evolutionary algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7): 1063-1074
Niño, E.D., Ardila, C., Donoso, Y., Jabba, D. (2010) A novel algorithm based on deterministic finite automaton for solving the mono-objective symmetric traveling salesman problem. Int. J. of Artificial Intelligence, (A 10), pp. 101-108. 5
Niño, E.D., Ardila, C., Donoso, D., Jabba, D., Barrios, A. (2011) MODS: A novel metaheuristic of deterministic swapping for the multi objective optimization of combinatorials problems. Computer Technology and Application, 2(4), pp. 280-292
Niño, E.D. (2012) SAMODS and SAGAMODS: Novel algorithms based on the automata theory for the multiobjective optimization of combinatorial problems. International Journal of Artificial Intelligence, ISSN 0974-0635, Volume 8, Number S12, pp. 147-165
Niño-Ruiz, E.D. (2014) Evolutionary Algorithm based on the Automata Theory for the Multi-objective Optimization of Combinatorial Problems. International Journal of Computers Communications & Control, 7(5): 916
Olschewski, J., Ummels, M. (2010) The Complexity of Finding Reset Words in Finite Automata. Lecture Notes in Computer Science, str. 568-579
Popović, Ž., Bogdanović, S., Petković, T., Ćirić, M. (2002) Trapped automata. Publ. Math. Debrecen, 60, suppl., 661-677
Samotij, W. (2007) A note on the complexity of the problem of finding shortest synchronizing words. u: Proc. AutoMathA 2007, University of Palermo, CD
Takkar, A. (2014) A genetic algorithm for finite state automata. Indian Journal of Computer Science and Engineering, Vol. 5; No. 4, pp. 140-145
Yang, H., Wang, C., Du, N. (2012) High Level Synthesis using Learning Automata Genetic Algorithm. Journal of Computers, 7(10)