Results 201 to 210 of about 9,410 (233)
Maximum independent set in multiplex social networks and its application to influence maximization. [PDF]
Sci RepDaliri Khomami MM +2 more
europepmc +1 more source
Towards origins of virtual artificial life: an overview. [PDF]
Philos Trans R Soc Lond B Biol SciStepney S.
europepmc +1 more source
Spatiotemporal simulation of land use and land cover changes in Türkiye through a CA-Markov framework. [PDF]
Sci RepBozali N.
europepmc +1 more source
Modelling Mobility of Hunter-Gatherer Populations: A Dynamic Simulation Approach Based on Cellular Automata. [PDF]
J Archaeol Method TheoryHewitt RJ +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
International Journal of Foundations of Computer Science, 2016
We consider the model of deterministic set automata which are basically deterministic finite automata equipped with a set as an additional storage medium. The basic operations on the set are the insertion of elements, the removing of elements, and the test whether an element is in the set.
Kutrib, Martin +2 more
openaire +1 more source
We consider the model of deterministic set automata which are basically deterministic finite automata equipped with a set as an additional storage medium. The basic operations on the set are the insertion of elements, the removing of elements, and the test whether an element is in the set.
Kutrib, Martin +2 more
openaire +1 more source
ACM SIGLOG News, 2022
For the Automata Theory Column, we have an article by B. Srivathsan on the reachability problem in timed automata. Ever since timed automata were introduced by Alur and Dill, they have been widely used in the verification of real-time systems. Their appeal comes from a simple definition that couples expressiveness with computational tractability.
openaire +1 more source
For the Automata Theory Column, we have an article by B. Srivathsan on the reachability problem in timed automata. Ever since timed automata were introduced by Alur and Dill, they have been widely used in the verification of real-time systems. Their appeal comes from a simple definition that couples expressiveness with computational tractability.
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
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