Buscar
Mostrando ítems 1-10 de 259
Cellular automata-based spatial dynamic modeling for analyzing urban land use change
(2013-08-15)
This paper analyzes land use change in Rio Claro City and its surroundings, located in the southeastern state of Sao Paulo, in the period from 1988 to 1995, using air-borne digital imagery and a cellular automata model. ...
Dynamics of Automata Networks: Theory and numerical experiments.
(2021-08-02)
Automata Networks are discrete dynamical systems initially introduced by von Neumann [84], Mc-Culloch [50] and Ulam [81] and they have been used to model diverse complex systems such as the study of the evolution and ...
Pre-expansivity in cellular automata
(Elsevier, 2020)
We introduce the notion of pre expansivity for cellular automata (CA): it is the property of being positively expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). ...
Teaching-learning methodology for formal languages and automata theory
(2015-12-02)
Formal languages and automata (FLA) theory have fundamental relevance to the base of knowledge in the computer science area, especially focusing on scientific education. Usually presented by a discipline, the teaching-learning ...
Teaching-learning methodology for Formal Languages and Automata Theory
(Ieee, 2015-01-01)
Formal languages and automata (FLA) theory have fundamental relevance to the base of knowledge in the computer science area, especially focusing on scientific education. Usually presented by a discipline, the teaching-learning ...
Communication complexity and intrinsic universality in cellular automata
(Elsevier, 2011)
The notions of universality and completeness are central in the theories of computation
and computational complexity. However, proving lower bounds and necessary conditions
remains hard in most cases. In this article, ...
Una herramienta didáctica interactiva para la enseñanza-aprendizaje de los autómatas finitos deterministas
(Universidad Inca Garcilaso de la Vega, 2013-10)
La asignatura, teoría de la Computación se cataloga como una de las que presentan mayor dificultad para los estudiantes universitarios y se ha observado que el dominio del tema de los autómatas finitos es fundamental para ...