Results 41 to 50 of about 283,589 (317)
Distribution of the number of accessible states in a random deterministic automaton
Symposium on Theoretical Aspects of Computer Science, 2012 Arnaud Carayol, Cyril Nicaud
openalex +3 more sources
On History-Deterministic One-Counter Nets [PDF]
Foundations of Software Science and Computation Structure, 2022 We consider the model of history-deterministic one-counter nets (OCNs). History-determinism is a property of transition systems that allows for a limited kind of non-determinism which can be resolved 'on-the-fly'.
Aditya Prakash, K. S. Thejaswini
semanticscholar +1 more source
On the Expressive Power of Higher-Order Pushdown Systems [PDF]
Logical Methods in Computer Science, 2020 We show that deterministic collapsible pushdown automata of second order can recognize a language that is not recognizable by any deterministic higher-order pushdown automaton (without collapse) of any order.
Paweł Parys
doaj +1 more source
Random Deterministic Automata With One Added Transition [PDF]
Logical Methods in Computer ScienceEvery language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which in the worst case can go from $n$ states to $2^n$ states. In this article,
Arnaud Carayol +3 more
doaj +1 more source
Some Approaches to Modeling the Spatial Diffusion of Innovations [PDF]
Prostranstvennaâ Èkonomika, 2015 The study considers the problems of modeling diffusion of innovations in economic systems. The authors show the capabilities and limitations of the use of deterministic and probabilistic cellular automata in modeling the diffusion of innovations.
Yuriy Davidovich Schmidt +1 more
doaj +1 more source
Учёные записки Казанского университета: Серия Физико-математические науки, 2019 This paper considers the methods of construction (presentation) of the sets of ergodic stochastic matrices using automaton models and determination of the power estimates of the generated sets. The research aimed at developing algorithms for constructing
V.M. Zakharov +2 more
doaj +1 more source
Input-Driven Double-Head Pushdown Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We introduce and study input-driven deterministic and nondeterministic double-head pushdown automata. A double-head pushdown automaton is a slight generalization of an ordinary pushdown automaton working with two input heads that move in opposite ...
Markus Holzer +3 more
doaj +1 more source
New results on classical and quantum counter automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems. Then, we obtain a similar separation result between Las Vegas one-way probabilistic one-counter automaton and one ...
Masaki Nakanishi +2 more
doaj +1 more source
Token Games and History-Deterministic Quantitative-Automata [PDF]
Foundations of Software Science and Computation Structure, 2021 A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties, history-deterministic automata are useful in solving games and
Udi Boker, K. Lehtinen
semanticscholar +1 more source
Phase Space Invertible Asynchronous Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata.
Simon Wacker, Thomas Worsch
doaj +1 more source