Results 41 to 50 of about 44,777 (358)
Automaton semigroup constructions [PDF]
Semigroup Forum (2015) 90:763-774, 2013 The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton semigroup.
arxiv +1 more source
Opposition of the Natural and the Artificial in the Fictional World of Georges Sand: Doll, Puppet, Automaton [PDF]
Studia Litterarum, 2020 The article deals with the image of the doll and peculiarities of the opposition ‘living — lifeless’ concerned with this image in the works of George Sand.
Anna V. Popova
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
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
Molecular demultiplexer as a terminator automaton
Nature Communications, 2018 Molecular logic gates are expected to play an important role on the way to information processing therapeutic agents, especially considering the wide variety of physical and chemical responses that they can elicit in response to the inputs applied. Here,
I. S. Turan +3 more
semanticscholar +1 more source
On the orbits of automaton semigroups and groups [PDF]
Algebra and Discrete Mathematics, 2022 We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem for automaton groups is undecidable.
D'Angeli, D +3 more
openaire +4 more sources
Computational Conversion via Translation Rules for Transforming C++ Code Into UPPAAL’s Automata
IEEE Access, 2017 Formal methods help in quantifying the functional and nonfunctional requirements that are later used in the verification process for safety assurance in real-time systems.
Sidra Sultana, Fahim Arif
doaj +1 more source
Cellular-automaton decoders for topological quantum memories [PDF]
npj Quantum Information, 2014 We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton.
Michael Herold +3 more
semanticscholar +1 more source
Universal Hypergraphic Automata Representation by Autonomous Input Symbols
Моделирование и анализ информационных систем, 2018 Hypergraphic automata are automata with state sets and input symbol sets being hypergraphs which are invariant under actions of transition and output functions. Universally attracting objects of a category of hypergraphic automata are automata Atm(H1,H2).
Ekaterina Khvorostukhina +1 more
doaj +1 more source