Results 1 to 10 of about 5,385 (262)
Ambiguity Hierarchy of Regular Infinite Tree Languages [PDF]
Logical Methods in Computer Science, 2021 An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if it is k-ambiguous for some
Alexander Rabinovich, Doron Tiferet
doaj +1 more source
Abstract and Applied Analysis, 2014 State estimation problem is considered for a kind of wireless network control system with stochastic uncertainty and time delay. A sliding mode observer is designed for the system under the situation that no missing measurement occurs and system ...
Pengfei Guo +5 more
doaj +1 more source
Homomorphic Encryption of Supervisory Control Systems Using Automata
IEEE Access, 2020 Cyber-physical systems have been highly integrated into many contemporary infrastructures. As this integration deepens, the importance of protecting these systems from unauthorized access and data corruption increases.
Sian Zhou +5 more
doaj +1 more source
Photography as Automaton: Roland Barthes and Fellini’s Mechanical Doll
CoSMO, 2019 The stated purpose of Camera Lucida was to champion photography over cinema; however, at a critical moment in the text Roland Barthes turns to an episode from a film, a scene involving an automaton in Fellini’s Casanova, to expound the notion of the ...
Margaret E Owens
doaj +1 more source
CELLULAR AUTOMATON SUPERCOLLIDERS [PDF]
International Journal of Modern Physics C, 2011 Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular automaton analogous of localizations or quasi-local collective excitations traveling in a spatially extended nonlinear medium.
Martínez, Genaro J. +3 more
openaire +2 more sources
Computational Conversion via Translation Rules for Transforming C++ Code Into UPPAAL’s Automata
IEEE Access, 2017 Formal methods help in quantifying the functional and nonfunctional requirements that are later used in the verification process for safety assurance in real-time systems.
Sidra Sultana, Fahim Arif
doaj +1 more source
Computers, 2022 Given the grid features of digital images, a direct relation with cellular automata can be established with transition rules based on information of the cells in the grid. This document presents the modeling of an algorithm based on cellular automata for
Karen Vanessa Angulo +2 more
doaj +1 more source
MOBILE LEARNING: CONTEXT ADAPTATION AND SCENARIO APPROACH
Открытое образование (Москва), 2016 The paper proposes a model of an open architecture for component context-dependent systems of computer training to the needs of the software applications of intelligent learning environments and adaptive learning systems.
Vladimir V. Kureichik +2 more
doaj +1 more source
Free Choice in Quantum Theory: A p-adic View
Entropy, 2023 In this paper, it is rigorously proven that since observational data (i.e., numerical values of physical quantities) are rational numbers only due to inevitably nonzero measurements errors, the conclusion about whether Nature at the smallest scales is ...
Vladimir Anashin
doaj +1 more source
Automaton semigroup constructions [PDF]
Semigroup Forum, 2014 13 pages; 2 ...
Brough, Tara, Cain, Alan J.
openaire +2 more sources