Results 31 to 40 of about 4,904 (291)
Can Nondeterminism Help Complementation? [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature.
Yang Cai, Ting Zhang
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
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
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
Homology theories and tolerance automata
Discrete Mathematics, 1981 AbstractWe present three possible approaches to a homology theory of automata. Two of these require the state to possess a tolerance. This permits us to proceed by analogy with either the simplicial or the cubical theories of the topological category. The third approach describes a homology theory of automata as such.Fixed simplex theorems are stated ...
A. Muir, M. W. Warner
openaire +2 more sources
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
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
Exploring lipid diversity and minimalism to define membrane requirements for synthetic cells
FEBS Letters, EarlyView.Designing the lipid membrane of synthetic cells is a complex task, in which its various roles (among them solute transport, membrane protein support, and self‐replication) should all be integrated. In this review, we report the latest top‐down and bottom‐up advances and discuss compatibility and complexity issues of current engineering approaches ...
Sergiy Gan +2 more
wiley +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
FEBS Letters, EarlyView.Spinal muscular atrophy (SMA) is a genetic disease affecting motor neurons. Individuals with SMA experience mitochondrial dysfunction and oxidative stress. The aim of the study was to investigate the effect of an antioxidant and neuroprotective substance, ergothioneine (ERGO), on an SMNΔ7 mouse model of SMA.
Francesca Cadile +8 more
wiley +1 more source