Finite state automata are crucial for numerous practical algorithms of computer science. We show how to use genetic algorithms and fuzzy automata to simplify a class of FSA defined by labeled graphs and considered in computer science and engineering literature.
History
Pagination
192-195
Publisher
School of Engineering
Publication status
Published
Event title
AISAT 2004, \Artificial Intelligence in Science and Technology 2004\""