Results 81 to 90 of about 63,385 (219)

A Direct Translation from XPath to Nondeterministic Automata

, 2011
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into automata, and produce efficient translations of XPath queries into automata on ...
Leonid Libkin, Libkin, Leonid, Nadime Francis, Claire David, David, Claire, Francis, Nadime   +5 more
core  

A transformation sequencing approach to pseudorandom number generation [PDF]

, 2007
This paper presents a new approach to designing pseudorandom number generators based on cellular automata. Current cellular automata designs either focus on i) ensuring desirable sequence properties such as maximum length period, balanced distribution ...
Guan, SU, Tan, SK
core   +1 more source

An overview of the second-previous memory effect in the strictlyalternating donation game

Journal of Physics Communications
Game theory delves into the examination of strategic behaviour across diverse domains such as insurance, business, military, biology, and more, with the aim of deriving optimal decisions.
Essam EL-Seidy, Mohamed Mamdouh Zayet, Amira R Abdel-Malek, Aya Rabie   +3 more
doaj   +1 more source

Vaucanson’s Automata as Devices of Enlightenment

Sjuttonhundratal, 2011
Residing at the interstices of high and low culture, pleasure and utility, wonder and technique, Vaucanson's automata belonged to what historian Michael R.
Joan B. Landes
doaj   +1 more source

Minimizing finite automata is computationally hard

, 2002
It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6].
Malcher, Andreas
core  

Improved learning automata applied to routing in multi-service networks [PDF]

, 2000
Multi-service communications networks are generally designed, provisioned and configured, based on source-destination user demands expected to occur over a recurring time period.
Aranzulla, P.J., Aranzulla, Philip John
core  

On rational solution of the state equation of a finite automaton

International Journal of Mathematics and Mathematical Sciences, 1988
We prove that the necessary and sufficient condition for the state equation of a finite automaton M to have a rational solution is that the lexicographical Gödel numbers of the strings belonging to each of the end-sets of M form an ultimately periodic ...
R. Chaudhuri, H. Höft
doaj   +1 more source

Compositional Detection of Zeno Behaviour in Timed Automata [PDF]

, 2006
The formal specification and verification of real-time systems are difficult tasks, given the complexity of these systems and the safety-critical role they usually play. Timed Automata, and real-time model-checking, have emerged as powerful tools to deal
Howard Bowman, Gomez, Rodolfo, Bowman, Howard   +2 more
core  

A Family of Controllable Cellular Automata for Pseudorandom Number Generation

, 2002
In this paper, we present a family of novel Pseudorandom Number Generators (PRNGs) based on Controllable Cellular Automata (CCA) ─ CCA0, CCA1, CCA2 (NCA), CCA3 (BCA), CCA4 (asymmetric NCA), CCA5, CCA6 and CCA7 PRNGs.
Zhang, S., Guan, SU, Zhang, S, Guan, S.-U.   +3 more
core   +1 more source

Quantum Dot Cellular Automata Check Node Implementation for LDPC Decoders [PDF]

, 2013
The quantum dot Cellular Automata (QCA) is an emerging nanotechnology that has gained significant research interest in recent years. Extremely small feature sizes, ultralow power consumption, and high clock frequency make QCA a potentially attractive ...
Ruo Roch, Massimo, Graziano, Mariagrazia, Masera, Guido, Awais, Muhammad, Vacca, Marco   +4 more
core   +1 more source