Search results for " Automata"
showing 10 items of 436 documents
The Average State Complexity of the Star of a Finite Set of Words Is Linear
2008
We prove that, for the uniform distribution over all sets Xof m(that is a fixed integer) non-empty words whose sum of lengths is n, $\mathcal{D}_X$, one of the usual deterministic automata recognizing X*, has on average $\mathcal{O}(n)$ states and that the average state complexity of X*is i¾?(n). We also show that the average time complexity of the computation of the automaton $\mathcal{D}_X$ is $\mathcal{O}(n\log n)$, when the alphabet is of size at least three.
On solving single elevator-like problems using a learning automata-based paradigm
2020
This paper concentrates on a host of problems with characteristics similar to those that are related to moving elevators within a building. These are referred to as Elevator-like problems (ELPs), and their common phenomena will be expanded on in the body of the paper. We shall resolve ELPs using a subfield of AI, namely the field of learning automata (LA). Rather than working with the well-established mathematical formulations of the field, our intention is to use these tools to tackle ELPs, and in particular, those that deal with single “elevators” moving between “floors”. ELPs have not been tackled before using AI. In a simplified domain, the ELP involves the problem of optimizing the sch…
Topological properties of cellular automata on trees
2012
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.
OntoVersionGraph : a change management methodology dedicated to formal ontologies and their user views in a collaborative context
2014
The world changes over time, impacting the knowledge of every subdomain it contains. Therefore systems describing the knowledge of a certain domain should be able to consider changes occurred to keep its knowledge representation up-to-date. Formal ontologies are one of them: they explicitly and formally represent the knowledge of a domain in all its forms and modes of existence. Collaboratively developed, a formal ontology allows the domain users to understand each other by sharing the same terminology despite the different assumptions they have on the domain conceptualization. However, due to its completeness, the complexity of its conceptualization can sometimes make the domain knowledge …
Asymptotic bit frequency in Fibonacci words
2021
It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.
Coupling Cellular Automata and Markov Chains to Design prospective Scenarios of Urbanization. An application to Strasbourg Cross-border Area
2016
International audience
Land use simulation: statistical analysis approaches to calibrate cellular automata
2015
International audience
Constraint Cellular Automata for Urban Development simulation. An Application to Strasbourg Cross-border Area
2015
International audience
SYSTEM DYNAMICS VERSUS CELLULAR AUTOMATA IN MODELLING PANIC SITUATIONS
2008
International audience; In this paper we face system dynamics modelling and cellular automata to model panic processes. We compare both models using phase plans. The results of simulation confirm our hypotheses: First, a collective behaviour is not the arithmetical sum of the individual behaviours. Secondly the crowd causes the emergence of collective panic from individual panic. Both types of methodology produce the emergence of panic and identical curves for different values of initial conditions and parameters. But the effects of thresholds vary according to these values.
On-line construction of a small automaton for a finite set of words
2009
In this paper we describe a ``light'' algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on the suffixes of a text, showing how this automaton is small. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton.