Results 11 to 20 of about 92,067 (341)
Algorithms for Converting Finite Automata Corresponding to Infinite Iterative Trees
Современные информационные технологии и IT-образование, 2021 In this paper, we work with some different variants of finite automata, each of which corresponds to an infinite iterative tree constructed for some given morphism.
Mikhail Abramyan, Boris Melnikov
doaj +1 more source
Triadic Automata and Machines as Information Transformers
Information, 2020 Algorithms and abstract automata (abstract machines) are used to describe, model, explore and improve computers, cell phones, computer networks, such as the Internet, and processes in them.
Mark Burgin
doaj +1 more source
Fast Algorithms for Computing the Statistics of Pattern Matching
IEEE Access, 2021 Pattern matching is a fundamental problem in theoretical computer science. The algorithms for pattern matching and the study on the statistics of pattern matching have found enormous applications in practical fields.
Danna Zhang, Kai Jin
doaj +1 more source
K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, the position automaton P due to Glushkov, the c-continuation automaton C due to Champarnaud and Ziadi, the follow ...
Ludovic Mignot +2 more
doaj +1 more source
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
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
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
CAYLEY AUTOMATON SEMIGROUPS [PDF]
International Journal of Algebra and Computation, 2009 In this paper we characterize when a Cayley automaton semigroup is finite, is free, is a left zero semigroup, is a right zero semigroup, is a group, or is trivial. We also introduce dual Cayley automaton semigroups and discuss when they are finite.
openaire +2 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