Results 21 to 30 of about 92,067 (341)
Languages of single-valued neutrosophic general automata [PDF]
Journal of Mahani Mathematical Research, 2023 In this paper, we define the concepts of single-valued neutrosophic general automaton, complete and deterministic single-valued neutrosophic general automaton.
Marzieh Shamsizadeh +2 more
doaj +1 more source
Big Data and Cognitive Computing, 2021 Knowledge processing is an important feature of intelligence in general and artificial intelligence in particular. To develop computing systems working with knowledge, it is necessary to elaborate the means of working with knowledge representations (as ...
Mark Burgin, Rao Mikkilineni
doaj +1 more source
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
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
Human and Machine: Gender Inversion and the Problem of Artificial Body in the Short Story by Anna Barkova “The Steel Husband” (1926) [PDF]
Литературный фактThe article considers the short story by Anna Barkova, “The Steel Husband,” in many ways: as a point of intersection of several different influences (“pornographic prose” from the heyday of the “women’s question”; the poetry of the Proletcultists, in ...
Veronika B. Zuseva-Özkan
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
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
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
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