Results 251 to 260 of about 194,426 (295)
Some of the next articles are maybe not open access.
EFFICIENT AUTOMATA CONSTRUCTIONS AND APPROXIMATE AUTOMATA
International Journal of Foundations of Computer Science, 2008In this paper, we present data structures and algorithms for efficiently constructing approximate automata. An approximate automaton for a regular language L is one which accepts at leastL. Such automata can be used in a variety of practical applications, including network security pattern matching, in which false-matches are only a performance ...
Watson, B.W. +4 more
openaire +3 more sources
Philosophy, 1958
I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently been written on this subject that there are still many misunderstandings about their capacity and significance.
openaire +1 more source
I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently been written on this subject that there are still many misunderstandings about their capacity and significance.
openaire +1 more source
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