Results 41 to 50 of about 118,707 (380)
Subsequence Automata with Default Transitions [PDF]
, 2016 Let $S$ be a string of length $n$ with characters from an alphabet of size $\sigma$. The \emph{subsequence automaton} of $S$ (often called the \emph{directed acyclic subsequence graph}) is the minimal deterministic finite automaton accepting all ...
Bille, Philip +2 more
core +3 more sources
Journal of Spectroscopy, 2013 Brain-computer interface (BCI) is one technology that allows a user to communicate with external devices through detecting brain activity. As a promising noninvasive technique, functional near-infrared spectroscopy (fNIRS) has recently earned increasing ...
Yan Zhang +5 more
doaj +1 more source
The automaton chronicles [PDF]
, 2018 The French philosopher René Descartes was reputedly fond of automata: they inspired his view that living things were biological machines that function like clockwork. Less known is a strange story that began to circulate after the philosopher’s death in 1650. This centred on Descartes’s daughter Francine, who died of scarlet fever at the age of five.
Cave, Stephen, Dihal, KSM
openaire +2 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
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
Complexity of checking whether two automata are synchronized by the same language [PDF]
, 2014 A deterministic finite automaton is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton to a particular one. We prove that it is a PSPACE-complete problem to check whether the language of reset words for a
D. Eppstein +10 more
core +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
Thirring quantum cellular automaton [PDF]
, 2017 We analytically diagonalize a discrete-time on-site interacting fermionic cellular automaton in the two-particle sector. Important features of the solutions sensibly differ from those of analogous Hamiltonian models.
A. Bisio +3 more
semanticscholar +1 more source
Automaton semigroups and groups: On the undecidability of problems related to freeness and finiteness [PDF]
Israel Journal of Mathematics, 2017 In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton (semi)groups and ...
D. D’Angeli +2 more
semanticscholar +1 more source
Coxeter Groups and Asynchronous Cellular Automata [PDF]
, 2010 The dynamics group of an asynchronous cellular automaton (ACA) relates properties of its long term dynamics to the structure of Coxeter groups. The key mathematical feature connecting these diverse fields is involutions.
Macauley, Matthew, Mortveit, Henning S.
core +3 more sources