Results 31 to 40 of about 109,516 (325)
Classical Automata on Promise Problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Promise problems were mainly studied in quantum automata theory. Here we focus on state complexity of classical automata for promise problems. First, it was known that there is a family of unary promise problems solvable by quantum automata by using a ...
Viliam Geffert, Abuzer Yakaryilmaz
doaj +1 more source
Sequences of Groups, Hypergroups and Automata of Linear Ordinary Differential Operators
Mathematics, 2021 The main objective of our paper is to focus on the study of sequences (finite or countable) of groups and hypergroups of linear differential operators of decreasing orders.
Jan Chvalina +3 more
doaj +1 more source
Solomon Marcus Contributions to Theoretical Computer Science and Applications
Axioms, 2021 Solomon Marcus (1925–2016) was one of the founders of the Romanian theoretical computer science. His pioneering contributions to automata and formal language theories, mathematical linguistics and natural computing have been widely recognised ...
Cristian S. Calude, Gheorghe Păun
doaj +1 more source
Automata finiteness criterion in terms of van der Put series of automata functions
, 2011 In the paper we develop the $p$-adic theory of discrete automata. Every automaton $\mathfrak A$ (transducer) whose input/output alphabets consist of $p$ symbols can be associated to a continuous (in fact, 1-Lipschitz) map from $p$-adic integers to $p ...
Anashin, Vladimir
core +1 more source
Bell's Theorem from Moore's Theorem [PDF]
, 2012 It is shown that the restrictions of what can be inferred from classically-recorded observational outcomes that are imposed by the no-cloning theorem, the Kochen-Specker theorem and Bell's theorem also follow from restrictions on inferences from ...
Ashby W. R. +19 more
core +1 more source
On path hypercompositions in graphs and automata
MATEC Web of Conferences, 2016 The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph.
Massouros Christos G.
doaj +1 more source
Efficient Implementation for Deterministic Finite Tree Automata Minimization
Journal of Computing and Information Technology, 2016 We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimized ...
Younes Guellouma, Hadda Cherroun
doaj +1 more source
Neural architecture search for resource constrained hardware devices: A survey
IET Cyber-Physical Systems, 2023 With the emergence of powerful and low‐energy Internet of Things devices, deep learning computing is increasingly applied to resource‐constrained edge devices.
Yongjia Yang +4 more
doaj +1 more source
A Formal Model for Semantic Computing Based on Generalized Probabilistic Automata
Entropy, 2019 In most previous research, “semantic computing” refers to computational implementations of semantic reasoning. It lacks support from the formal theory of computation.
Guangjian Huang +3 more
doaj +1 more source
Mean-Field Analysis with Random Perturbations to Detect Gliders in Cellular Automata
Mathematics, 2023 Cellular automata are mathematical models that represent systems with complex behavior through simple interactions between their individual elements. These models can be used to study unconventional computational systems and complexity.
Juan Carlos Seck-Tuoh-Mora +3 more
doaj +1 more source