Results 11 to 20 of about 91,643 (301)
Elementary definability of the class of universal hypergraphic automata in the class of semigroups [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal
Molchanov, Vladimir Aleksandrovich +1 more
doaj +1 more source
Automaton semigroups: new construction results and examples of non-automaton semigroups [PDF]
, 2017 This paper studies the class of automaton semigroups from two perspectives: closure under constructions, and examples of semigroups that are not automaton semigroups.
Brough, Tara, Cain, Alan J.
core +2 more sources
AUTOMATED REMOTE MANAGEMENT AND CONTROL SYSTEM OF THE LABORATORY EQUIPMENT [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2017 The paper deals with the hardware and software implementation of automated remote management system of laboratory equipment for studying fundamentals of electronics and circuit technology.
V. I. Freyman
doaj +1 more source
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
Truly On-The-Fly LTL Model Checking [PDF]
, 2005 We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B\"{u}chi automaton for the negation of the formula and the emptiness check.
Hammer, Moritz +2 more
core +6 more sources
Wishing for the Watch Face in Jonathan Swift’s “The Progress of Beauty”
ABO : Interactive Journal for Women in the Arts 1640-1830, 2018 This article illuminates the technological underpinnings of Jonathan Swift’s satire, “The Progress of Beauty” (1719), by exploring how eighteenth-century poetics of beauty and scientific progress pit human against automaton.
Jantina Ellens
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
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
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