Results 51 to 60 of about 44,777 (358)
Experimental demonstration of quantum finite automaton
npj Quantum Information, 2019 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
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
Deterministic automata for extended regular expressions
Open Computer Science, 2017 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
The Černy Conjecture for aperiodic automata [PDF]
arXiv, 2021 A word w is called a synchronizing (recurrent, reset) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some state; a DFA that has a synchronizing word is said to be synchronizing. Cerny conjectured in 1964 that every n-state synchronizing DFA possesses a synchronizing word of length at most (n -1)2.
arxiv
Sensors, 2018 Following hospital discharge, millions of patients continue to recover outside formal healthcare organizations (HCOs) in designated transitional care periods (TCPs).
Faisal Alkhaldi, Ali Alouani
doaj +1 more source
Theoretical Computer Science, 2009 AbstractThe concept of an automaton group generalizes easily to semigroups, and the systematic study of this area is beginning. This paper aims to contribute to that study. The basic theory of automaton semigroups is briefly reviewed. Various natural semigroups are shown to arise as automaton semigroups.
openaire +2 more sources
Service Function Chaining Based on Grammar in Software Defined Networks [PDF]
مجله مدل سازی در مهندسی, 2019 Service Function Chaining is an architecture for orchestrating network services that assign choice to the network. This architecture is essentially a policy structure that should form the proper chain of services.
Pouya Khosravian Dehkordi +3 more
doaj +1 more source
On the Suffix Automaton with Mismatches [PDF]
, 2007 In this paper we focus on the construction of the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of Sk in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition
M. CROCHEMORE +3 more
openaire +3 more sources
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
Journal of Computer and System Sciences, 1976 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 +2 more sources