Results 41 to 50 of about 6,057,560 (362)
Effective theories for circuits and automata [PDF]
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2011 Abstracting an effective theory from a complicated process is central to the study of complexity. Even when the underlying mechanisms are understood, or at least measurable, the presence of dissipation and irreversibility in biological, computational, and social systems makes the problem harder.
openaire +4 more sources
Computation Theory of Cellular Automata [PDF]
Communications in Mathematical Physics, 1984 Self-organizing behaviour in cellular automata is discussed as a computational process. Formal language theory is used to extend dynamical systems theory descriptions of cellular automata. The sets of configurations generated after a finite number of time steps of cellular automaton evolution are shown to form regular languages. Many examples are given.
openaire +4 more sources
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
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
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
The regulator theory for finite automata
Information and Control, 1976 This paper deals with the problem of controlling the state of a finite automaton to some preassigned value; namely, the regulator problem. First, the simplest situation where the state of the system is currently known is briefly considered and the corresponding solution pointed out.
Guido Guardabassi, Marino Gatto
openaire +2 more sources
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
Modelling Consciousness within Mental Monism: An Automata-Theoretic Approach
Entropy, 2020 Models of consciousness are usually developed within physical monist or dualistic frameworks, in which the structure and dynamics of the mind are derived from the workings of the physical brain.
Peter B. Lloyd
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
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