نتایج جستجو برای: ellular automata
تعداد نتایج: 22024 فیلتر نتایج به سال:
Abstract Stateless ordered restart-delete automata (stl-ORD-automata) are studied. These obtained from the stateless restarting (stl-ORWW-automata) by introducing an additional operation, which, based on surrounding context, deletes a single letter. While stl-ORWW-automata accept regular languages, we show that swift stl-ORD-automata yield characterization for class of context-free languages. H...
This paper gives a tableau-based technique for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of given formula. Finite LTL differs from traditional that interpreted with respect to finite, rather than infinite, sequences states; this fact means automata, ω -automata such as those developed by Büchi an...
Abstract In 2021, Casares, Colcombet, and Fijalkow introduced the Alternating Cycle Decomposition (ACD) to study properties transformations of Muller automata. We present first practical implementation ACD in two different tools, Owl Spot, adapt it framework Emerson-Lei automata, i.e., $$\omega $$ ω -automata...
in the last decade, cellular automata models have been widely used for simulation spatial phenomena; however, exact nature of these models have been lead to various limitations for essential simulation of these phenomena. in this research, traditional cellular automata models have been developed through fuzzy theory, in which, transition rules are expressed based on fuzzy logic control methodol...
the cellular automata method has been used to simulate the pattern formation of the schlögl model as a bistable reaction-diffusion system. both microscopic and macroscopic cellular automata approaches have been considered and two different methods for obtaining the probabilities in the microscopic approach have been mentioned. the results show the tendency of the system towards the more stable ...
The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along wi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید