Results 21 to 30 of about 118,707 (380)
Cellular-Automaton Decoders with Provable Thresholds for Topological Codes. [PDF]
Physical Review Letters, 2018 We propose a new cellular automaton (CA), the sweep rule, which generalizes Toom's rule to any locally Euclidean lattice. We use the sweep rule to design a local decoder for the toric code in d≥3 dimensions, the sweep decoder, and rigorously establish a ...
Aleksander Kubica, J. Preskill
semanticscholar +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
The size of subsequence automaton [PDF]
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zdeněk Troníček +2 more
openaire +3 more sources
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
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
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
Smarandache Semi-Automaton And Automaton [PDF]
Smarandache Notions Journal archive, 2004 In this paper we study the Smarandache Semi-Automaton and Automaton using Smarandache free groupoids.
openaire +1 more source
Advances in Group Theory and Applications, 2020 28 pages, 12 ...
Cavaleri M. +3 more
openaire +3 more sources
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
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