Search results for "Cellular Automaton"
showing 10 items of 77 documents
Mathematical logic and quantum finite state automata
2009
AbstractThis paper is a review of the connection between formulas of logic and quantum finite-state automata in respect to the language recognition and acceptance probability of quantum finite-state automata. As is well known, logic has had a great impact on classical computation, it is promising to study the relation between quantum finite-state automata and mathematical logic. After a brief introduction to the connection between classical computation and logic, the required background of the logic and quantum finite-state automata is provided and the results of the connection between quantum finite-state automata and logic are presented.
Jahn-Teller effect in molecular electronics: quantum cellular automata
2017
The article summarizes the main results of application of the theory of the Jahn-Teller (JT) and pseudo JT effects to the description of molecular quantum dot cellular automata (QCA), a new paradigm of quantum computing. The following issues are discussed: 1) QCA as a new paradigm of quantum computing, principles and advantages; 2) molecular implementation of QCA; 3) role of the JT effect in charge trapping, encoding of binary information in the quantum cell and non-linear cell-cell response; 4) spin-switching in molecular QCA based on mixed-valence cell; 5) intervalence optical absorption in tetrameric molecular mixed-valence cell through the symmetry assisted approach to the multimode/mul…
Representation of Autonomous Automata
2001
An autonomous automaton is a finite automaton with output in which the input alphabet has cardinality one when special reduced. We define the transition from automata to semigroups via a representation successful if given two incomparable automata (neither simulate the other), the semigroups representing the automata are distinct. We show that representation by the transition semigroup is not successful. We then consider a representation of automata by semigroups of partial transformations. We show that in general transition from automata to semigroups by this representation is not successful either. In fact, the only successful transition presented is the transiton to this semigroup of par…
A Short Presentation of LucSim
2017
LucSim is a cellular automata (CA) dedicated to geographical analysis and spatial simulation for researchers and advanced planning institutes, providing user-friendly software in order to analyze and simulate land use changes and dynamics. Two complementary models are integrated in the CA: (1) a Markov Chain used to calculate transition matrices from a date to another, and (2) a Decision Tree able to automatically determine a set of transition rules to be applied on land use data. LucSim includes GIS compatibility functions allowing to display ESRI shapefiles and is based on raster georeferenced images saved in TIF format. It was mostly applied on French urban case studies.
Towards a Theory of Life
2015
In this paper, I set out the contributions made by some European biologists, as well as other more heterodox ones, to the recent development of theoretical thinking in biology. Theoretical biology is a relatively new discipline when compared with theoretical physics, in part because the formal languages of logic and computing which it uses have only emerged recently. Finally, I suggest that in order to build a theory of life we need to combine a cell theory based on a proper description of the laws that map the genotype in the phenotype and vice versa with the laws of evolution. Only then will we be able to properly explain the transformation and complexity of living things.
Modeling urban growth by cellular automata
1996
International audience; The structural development of human settlements can be characterized as a complex highly feedbacketed process. The assumption that this process is governed by rather few fundamental laws stimulated a considerable research in the field of urban growth during the last decade. Aiming at the comprehension of the basic underlying dynamics different approaches from the field of self-organizing systems have been proposed. In this paper we present a "cellular model" of urban growth dynamics based on the work of White, Engelen and Uljee. As a starting point this model throws some light on the mechanism of urban growth. But even more important, it raises a lot of questions con…
Complex Adaptive Systems and Agent-Based Modelling
2015
In a labour–education market system, there are many individuals and firms with adaptive behaviour. As we have seen in the previous chapter, networks are prevalent in LEMS and play an important role in many decisions of its actors. Thus, LEMS can be analysed as a complex adaptive system (CAS). Agent-based modelling (ABM) is typically used for such purposes, and the next chapter will dig into details of various ways of applying ABM in modelling LEMS. To be ready for it, we first have to understand the motivation behind and the details of this method. This is what will be discussed here.
Molecular Switching, Logics, and Memories
2013
The concepts of molecular switch, molecular logics and memories are intimately related. In this work a review of these three topics is given. While the main examples concern the field of inorganic chemistry, in a few cases organic systems are presented to better illustrate the concepts. The basic notions of the logics gates usually used by the nowadays computers is presented and the modus operandi to transpose these concepts to the molecular level is discussed. Examples of switches driven by external stimuli such as light-induced, metal-ion, redox, photobistable, and complexation–decomplexation are described in this chapter. The extension of switches working in solution to solid devices are…
Quantum Finite One-Counter Automata
1999
In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata in [1]. The well-formedness conditions for the automata are specified ensuring unitarity of evolution. A special kind of QF1CA, called simple, that satisfies the well-formedness conditions is introduced. That allows specify rules for constructing such automata more naturally and simpler than in general case. Possible models of language recognition by QF1CA are considered. The recognition of some languages by QF1CA is shown and compared with recognition by probabilistic counterparts.
Semipredictable dynamical systems
2015
A new class of deterministic dynamical systems, termed semipredictable dynamical systems, is presented. The spatiotemporal evolution of these systems have both predictable and unpredictable traits, as found in natural complex systems. We prove a general result: The dynamics of any deterministic nonlinear cellular automaton (CA) with $p$ possible dynamical states can be decomposed at each instant of time in a superposition of $N$ layers involving $p_{0}$, $p_{1}$,... $p_{N-1}$ dynamical states each, where the $p_{k\in \mathbb{N}}$, $k \in [0, N-1]$ are divisors of $p$. If the divisors coincide with the prime factors of $p$ this decomposition is unique. Conversely, we also prove that $N$ CA w…