Results 21 to 30 of about 44,777 (358)
The size of subsequence automaton [PDF]
Theoretical Computer Science, 2003 AbstractGiven a set of strings, the subsequence automaton accepts all subsequences of these strings. We derive a lower bound for the maximum number of states of this automaton. We prove that the size of the subsequence automaton for a set of k strings of length n is Ω(nk/(k+1)kk!) for any k⩾1.
Zdeněk Troníček +2 more
openaire +2 more sources
Determinisability of register and timed automata [PDF]
Logical Methods in Computer Science, 2022 The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton.
Lorenzo Clemente +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
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
Sustainability, 2019 Land use and land cover (LULC) form a baseline thematic map for monitoring, resource management, and planning activities and facilitate the development of strategies to balance conservation, conflicting uses, and development pressures.
M. H. Saputra, Han Soo Lee
semanticscholar +1 more source
CELLULAR AUTOMATON SUPERCOLLIDERS [PDF]
International Journal of Modern Physics C, 2011 Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular automaton analogous of localizations or quasi-local collective excitations traveling in a spatially extended nonlinear medium.
Andrew Adamatzky +5 more
openaire +3 more sources
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
Free Choice in Quantum Theory: A p-adic View
Entropy, 2023 In this paper, it is rigorously proven that since observational data (i.e., numerical values of physical quantities) are rational numbers only due to inevitably nonzero measurements errors, the conclusion about whether Nature at the smallest scales is ...
Vladimir Anashin
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
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