Results 241 to 250 of about 194,426 (295)
Formation of few-electron triple quantum dots in ZnO heterostructures. [PDF]
Sci RepBaba K +6 more
europepmc +1 more source
A Criterion for Distinguishing Temporally Different Dynamical Systems. [PDF]
Entropy (Basel)Kagan E.
europepmc +1 more source
Maximum independent set in multiplex social networks and its application to influence maximization. [PDF]
Sci RepDaliri Khomami MM +2 more
europepmc +1 more source
Mapping coastal transformations with a novel Cellular Automata-Markov-Random forest framework for land use change modeling. [PDF]
Sci RepNikoo MR, Zarei E, Al-Wardy M.
europepmc +1 more source
Self-Organizing Wireless Sensor Networks Solving the Coverage Problem: Game-Theoretic Learning Automata and Cellular Automata-Based Approaches. [PDF]
Sensors (Basel)Seredynski F +4 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