Results 31 to 40 of about 194,426 (295)
Single Valued Neutrosophic General Machine [PDF]
Neutrosophic Sets and Systems, 2022 In this paper, first of all, considering the notions of single-valued neutrosophic and general fuzzy automata we present the concept of single-valued neutrosophic general machine, to simplicity, SVNGM.
Marzieh Shamsizadeh
doaj +1 more source
Theoretical Computer Science, 2012 Reaction systems are a formal model that has been introduced to investigate the interactive behaviors of biochemical reactions. Based on the formal framework of reaction systems, we propose new computing models called reaction automata that feature (string) language acceptors with multiset manipulation as a computing mechanism, and show that reaction ...
Okubo, Fumiya +2 more
openaire +2 more sources
Deciding the value 1 problem for probabilistic leaktight automata [PDF]
, 2015 The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1?
Fijalkow, Nathanaël +3 more
core +5 more sources
On discovering functions in actin filament automata [PDF]
Royal Society Open Science, 2019 We simulate an actin filament as an automaton network. Every atom takes two or three states and updates its state, in discrete time, depending on a ratio of its neighbours in some selected state.
Andrew Adamatzky
doaj +1 more source
Clocks, Automata and the Mechanization of Nature (1300–1600)
Philosophies, 2022 This paper aims at tracking down, by looking at late medieval and early modern discussions over the ontological status of artifacts, the main steps of the process through which nature became theorized on a mechanistic model in the early 17th century. The
Sylvain Roudaut
doaj +1 more source
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique [PDF]
, 2008 In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the large alphabet ...
Michele Bugliesi, Qiqi Yan
core +1 more source
Quantum finite multitape automata
, 1999 Quantum finite automata were introduced by C.Moore, J.P. Crutchfield, and by A.Kondacs and J.Watrous. This notion is not a generalization of the deterministic finite automata.
Ambainis, Andris +4 more
core +1 more source
Approximate Comparison of Functions Computed by Distance Automata [PDF]
, 2015 Distance automata are automata weighted over the semiring (N∪{∞},min,+) (the tropical semiring). Such automata compute functions from words to N∪{∞}. It is known from Krob that the problems of deciding ‘ f≤g’ or ‘ f=g’ for f and g computed by distance ...
Colcombet, T., Daviaud, L.
core +1 more source
UNAMBIGUOUS CONSTRAINED AUTOMATA [PDF]
International Journal of Foundations of Computer Science, 2012 The class of languages captured by Constrained Automata (CA) that are unambiguous is shown to possess more closure properties than the provably weaker class captured by deterministic CA. Problems decidable for deterministic CA are nonetheless shown to remain decidable for unambiguous CA, and testing for regularity is added to this set of decidable ...
Cadilhac, Michaël +2 more
openaire +2 more sources
On finitely ambiguous B\"uchi automata
, 2018 Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking.
A Arnold +14 more
core +1 more source