Automatizando a obtenção da complexidade baseada em linguagem regular de autômatos celulares elementares

• Ano de defesa: 2006
• Autor(a) principal: Miki, Fábio Tokio
• Orientador(a): Oliveira, Pedro Paulo Balbi de
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso embargado
• Idioma: por
• Instituição de defesa: Universidade Presbiteriana Mackenzie
• Palavras-chave em Português: autômatos celulares; automação; engenharia da computação; engenharia eletrônica
• Palavras-chave em Inglês: cellular automata; automation; computational engineering; electronics engineering
• Área do conhecimento CNPq: CNPQ::ENGENHARIAS::ENGENHARIA ELETRICA
• Link de acesso: http://dspace.mackenzie.br/handle/10899/24394

Cellular automata are dynamical and computational systems, totally discrete in time, space and their state variables. It is known that, for elementary cellular automata, the set of all possible configurations that can appear at any finite number of time steps in their temporal evolution constitutes a regular language. As a consequence, such a set of strings can be represented by a minimal deterministic finite automaton, and the quantity of states and transitions among them may be considered a measure of the (regular language) complexity of the rule at issue; performing such a process may be computationally intensive, but it is well solved in the literature. However, when the target is the limit finite automaton, that is, the one after an infinite number of time steps, the machine may not exist for some rules, and the currently existing method fails to automatically generate it for some rules for which it is known otherwise that a solution does exist. This work aims at helping the solution of the latter problem, although the actual derivation of the algorithm to automatically generate the limit finite automaton has not yet been possible. However, it goes further the currently existing method, by means of a new algorithm for automatically yielding the growth expressions of the finite automaton representative of each time step, including some cases not reported so far, therefore shedding light over the issue, and opening perspectives for a subsequent automatic derivation of the limit finite automaton.