Buscar
Mostrando ítems 11-20 de 2330
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, ...
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 ...
Characterisation of limit measures of higher dimensional cellular automata
(Springer, 2017)
We consider the typical asymptotic behaviour of cellular automata of higher dimension (>= 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular ...
Alternation on cellular automata
(ELSEVIER, 1997-06-10)
In this paper we consider several notions of alternation in cellular automata: non-uniform,
uniform and weak alternation. We study relations among these notions and with alternating
Turing machines. It is proved that the ...
Normal numbers and finite automata
(Elsevier Science, 2013-03)
We give an elementary and direct proof of the following theorem: A real number is normal to a given integer base if, and only if, its expansion in that base is incompressible by lossless finite-state compressors (these are ...
Normality and Automata
(Academic Press Inc Elsevier Science, 2015-12)
We prove that finite-state transducers with injective behavior, deterministic or not, real-time or not, with no extra memory or a single counter, cannot compress any normal word. We exhaust all combinations of determinism, ...
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 ...
Autómatas de pila y gramáticas independientes del contexto
(2012-07-27)
En esta tesis se estudiara la relación entre los autómatas de pila y las gramáti- cas independientes del contexto. La forma de abordar el problema será tratar de encontrar un procedimiento que nos permita construir una ...
Automatic Finding Trapezoidal Membership Functions in Mining Fuzzy Association Rules Based on Learning Automata
Association rule mining is an important data mining technique used for discovering relationships among all data items. Membership functions have a significant impact on the outcome of the mining association rules. An ...