Results 61 to 70 of about 118,707 (380)
System management technology for technical maintenance of transport and technological machines [PDF]
The paper considers the generalized structure of maintenance system, including, in the general case, the protection subsystem, the functional diagnostics subsystem, the test diagnostics subsystem, the maintenance and repair subsystem.
Voronin Vladimir
doaj +1 more source
Experimental demonstration of quantum finite automaton
In quantum information science, a major task is to find the quantum models that can outperform their classical counterparts. Automaton is a fundamental computing model that has wide applications in many fields.
Yuling Tian +4 more
semanticscholar +1 more source
Integrability of a deterministic cellular automaton driven by stochastic boundaries [PDF]
We propose an interacting many-body space–time-discrete Markov chain model, which is composed of an integrable deterministic and reversible cellular automaton (rule 54 of Bobenko et al 1993 Commun. Math. Phys. 158 127) on a finite one-dimensional lattice
T. Prosen, C. Mejía-Monasterio
semanticscholar +1 more source
Deterministic automata for extended regular expressions
In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement.
Syzdykov Mirzakhmet
doaj +1 more source
A hybrid cellular-kinematic automaton is exhibited which can inspect itself and so obtain a complete description of its own structure; the description can be contained in a proper part of the automaton and made available to the automaton for its own perusal and use in self-simulation, self-reproduction, and self-repair and regulation.
openaire +3 more sources
Cellular-automaton decoders for topological quantum memories [PDF]
We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton.
Michael Herold +3 more
semanticscholar +1 more source
Reducing Clocks in Timed Automata while Preserving Bisimulation
Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number of clocks possible.
Arun-Kumar, S. +2 more
core +1 more source
HISTORY OF INNOVATION: BEGINNINGS OF THE CORRESPONDENCE BETWEEN TECHNOLOGY, ART AND DESIGN
The present article is based on a historical analysis of emblematic figures in the fields of philosophy, mathematics, and engineering, this article proposes an updated reading of the ancestral origin of digital technology, and its intrinsic link with art
Yucef Merhi
doaj +1 more source
We investigate numerically the behaviour of damage spreading in a Kauffman cellular automaton with quenched rules on a dynamical $\phi^3$ graph, which is equivalent to coupling the model to discretized 2D gravity.
Ambjørn +33 more
core +1 more source

