Results 181 to 190 of about 63,385 (219)
Some of the next articles are maybe not open access.
Embedding Torus Automata into a Ring of Automata
International Journal of Foundations of Computer Science, 1997In this paper, we deal with two-dimensional cellular automata. Our goal is to present a linear space and sub-linear time algorithm to embed a bounded finite torus, considered as a cellular space, into a ring of automata. Such an embedding has to preserve the neighborhood of the cells and to keep the periodicities of the torus.
openaire +2 more sources
2008
Some elements are presented of a forthcoming textbook on automata theory and formal languages, that puts more emphasis on equational reasoning. Some advantages of such an approach are discussed. This paper is dedicated to Ugo Montanari, who has contributed such a lot to concurrency theory and the theory of computational models.
openaire +1 more source
Some elements are presented of a forthcoming textbook on automata theory and formal languages, that puts more emphasis on equational reasoning. Some advantages of such an approach are discussed. This paper is dedicated to Ugo Montanari, who has contributed such a lot to concurrency theory and the theory of computational models.
openaire +1 more source
Journal of Organizational and End User Computing, 2017
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to ...
Rupali Bhardwaj, Anil Kr. Upadhyay
openaire +1 more source
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to ...
Rupali Bhardwaj, Anil Kr. Upadhyay
openaire +1 more source
2009
Usage automata are an extension of finite stata automata, with some additional features (e.g.\ parameters and guards) that improve their expressivity. Usage automata are expressive enough to model security requirements of real-world applications; at the same time, they are simple enough to be statically amenable, e.g.\ they can be model-checked against
openaire +2 more sources
Usage automata are an extension of finite stata automata, with some additional features (e.g.\ parameters and guards) that improve their expressivity. Usage automata are expressive enough to model security requirements of real-world applications; at the same time, they are simple enough to be statically amenable, e.g.\ they can be model-checked against
openaire +2 more sources
IEEE Transactions on Computers, 1974
By modifying the acceptability conditions in finite automata, a new and equivalent variant—the "structure automaton"— is obtained. The collection SR(Σ) of sets of tapes on Σ definable by deterministic structure-automata forms, however, a proper subset of the collection of regular sets.
openaire +1 more source
By modifying the acceptability conditions in finite automata, a new and equivalent variant—the "structure automaton"— is obtained. The collection SR(Σ) of sets of tapes on Σ definable by deterministic structure-automata forms, however, a proper subset of the collection of regular sets.
openaire +1 more source
1977
The idea of a finite automaton walking in a labyrinth goes back to Shannon /I/. In the last years this problem has been further investigated by D~pp /2/, M~ller /3/ and Budach /4/. DSpp posed the following question: Does there exist a finite initial automaton that finds a way out of every finite plane open labyrinth from any initial position and ...
openaire +1 more source
The idea of a finite automaton walking in a labyrinth goes back to Shannon /I/. In the last years this problem has been further investigated by D~pp /2/, M~ller /3/ and Budach /4/. DSpp posed the following question: Does there exist a finite initial automaton that finds a way out of every finite plane open labyrinth from any initial position and ...
openaire +1 more source
Deternimization of Büchi Automata as Partitioned Automata
2013In this paper, Nondeterministic Buchi Automata (NBA) are equivalently transformed as a new kind of deterministic omega automata, Deterministic Partitioned Automata (DPA). Different from the existing automata, at most three different transitions may occur between two states of a DPA. This leads to a determinization construction of NBA with smaller state
Cong Tian 0001 +2 more
openaire +1 more source
ACM SIGLOG News, 2017
Already in the seventies, strong results illustrating the intimate relationship between category theory and automata theory have been described and are still investigated. In this column, we provide a uniform presentation of the basic concepts that underlie minimization results in automata theory.
Thomas Colcombet, Daniela Petrisan
openaire +1 more source
Already in the seventies, strong results illustrating the intimate relationship between category theory and automata theory have been described and are still investigated. In this column, we provide a uniform presentation of the basic concepts that underlie minimization results in automata theory.
Thomas Colcombet, Daniela Petrisan
openaire +1 more source
Modifiable automata self-modifying automata
Acta Biotheoretica, 1992One of the most important features of living beings that seems universal is perhaps their ability to be modified in a functional way. In order to modelize this characteristic, we designed automata with a finite number of instantaneous internal descriptions, with input(s) and output(s) and which are able to be functionally modified.
openaire +2 more sources
Bell System Technical Journal, 1960
Since it is not clear, in general, how an automaton should best be characterized, one of the purposes of this paper is to find ways to go from one characterization to another. In doing so, we hare not been completely impartial — the programming approach has been emphasized more than the others. There are perhaps two reasons for this emphasis: First and
openaire +1 more source
Since it is not clear, in general, how an automaton should best be characterized, one of the purposes of this paper is to find ways to go from one characterization to another. In doing so, we hare not been completely impartial — the programming approach has been emphasized more than the others. There are perhaps two reasons for this emphasis: First and
openaire +1 more source