Results 211 to 220 of about 9,410 (233)
Some of the next articles are maybe not open access.
THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
International Journal of Foundations of Computer Science, 2005We explore expression automata with respect to determinism and minimization. We define determinism of expression automata using prefix-freeness. This approach is, to some extent, similar to that of Giammarresi and Montalbano's definition of deterministic generalized automata.
Han, Yo-Sub, Wood, Derick
openaire +2 more sources
Probabilistic asynchronous automata
Mathematical Systems Theory, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jesi S. +2 more
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
International Journal of Foundations of Computer Science, 2012
We present a new model of a two-dimensional computing device called restarting tiling automaton. The automaton defines a set of tile-rewriting, weight-reducing rules and a scanning strategy by which a tile to rewrite is being searched. We investigate properties of the induced families of picture languages.
Průša, Daniel, Mráz, František
openaire +2 more sources
We present a new model of a two-dimensional computing device called restarting tiling automaton. The automaton defines a set of tile-rewriting, weight-reducing rules and a scanning strategy by which a tile to rewrite is being searched. We investigate properties of the induced families of picture languages.
Průša, Daniel, Mráz, František
openaire +2 more sources
ACM SIGLOG News, 2014
In this column, Sylvain Schmitz summarizes two recent advances on the complexity of the reachability problem for vector addition systems with states. This is one of the most celebrated decidable problems in theoretical computer science, and until now, there was absolutely no upper bound on the complexity.
openaire +1 more source
In this column, Sylvain Schmitz summarizes two recent advances on the complexity of the reachability problem for vector addition systems with states. This is one of the most celebrated decidable problems in theoretical computer science, and until now, there was absolutely no upper bound on the complexity.
openaire +1 more source
Dimer automata and cellular automata
Physica D: Nonlinear Phenomena, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schöfisch, B., Hadeler, K. P.
openaire +1 more source
Cellular Automata, Learning Automata, and Cellular Learning Automata for Optimization
2021Since many real problems have several limitations and constraints for different environments, no standard optimization algorithms could work successfully for all kinds of problems. To enhance the abilities and improve the performance of a standard optimization algorithm for solving problems, several modifications or combinations with some techniques ...
Javidan Kazemi Kordestani +3 more
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
From Tree Automata to String Automata Minimization
Theory of Computing Systems, 2017The authors associate with any given deterministic finite bottom-up tree automaton (DFTA) a deterministic finite string automaton (DFA) that can be used for minimizing the tree automaton. By this reduction the existing efficient minimization algorithms designed for string automata become applicable to tree automata.
Guellouma, Younes +3 more
openaire +1 more source