Einloggen

Thematische Bibliographien / Reduction of automata / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Reduction of automata.

Zeitschriftenartikel zum Thema „Reduction of automata“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 1. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Reduction of automata" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Kilibarda, Goran. „On reduction of automata in labyrinths“. Publications de l'Institut Math?matique (Belgrade) 101, Nr. 115 (2017): 47–63. http://dx.doi.org/10.2298/pim1715047k.

Der volle Inhalt der Quelle

Annotation:

It is shown that every automaton acceptable for rectangular labyrinths can be reduced to an automaton that behaves according to either the left-hand rule or the right-hand rule, or does not move at all, in every plane rectangular labyrinth without leaves. This enables us to approach certain fundamental problems of the theory of automata in labyrinths in a quite different way.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Sargolzaei, A., K. K. Yen, K. Zeng, S. M. A. Motahari und S. Noei. „Impulse Image Noise Reduction Using Fuzzy-Cellular Automata Method“. International Journal of Computer and Electrical Engineering 6, Nr. 2 (2014): 191–95. http://dx.doi.org/10.7763/ijcee.2014.v6.820.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

JURDZIŃSKI, TOMASZ, und FRIEDRICH OTTO. „SHRINKING RESTARTING AUTOMATA“. International Journal of Foundations of Computer Science 18, Nr. 02 (April 2007): 361–85. http://dx.doi.org/10.1142/s0129054107004723.

Der volle Inhalt der Quelle

Annotation:

Restarting automata were introduced by Jančar et al. to model the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one rewrite step, which replaces a small part of the tape content by another, even shorter word. Here we consider a natural generalization of this model, called shrinking restarting automaton, where we only require that there exists a weight function such that each rewrite step decreases the weight of the tape content with respect to that function. While it is still unknown whether the two most general types of one-way restarting automata, the RWW-automaton and the RRWW-automaton, differ in their expressive power, we will see that the classes of languages accepted by the shrinking RWW-automaton and the shrinking RRWW-automaton coincide. As a consequence of our proof, it turns out that there exists a reduction by morphisms from the language class [Formula: see text] to the class [Formula: see text]. Further, we will see that the shrinking restarting automaton is a rather robust model of computation. Finally, we will relate shrinking RRWW-automata to finite-change automata. This will lead to some new insights into the relationships between the classes of languages characterized by (shrinking) restarting automata and some well-known time and space complexity classes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

FIGUEIRA, DIEGO, PIOTR HOFMAN und SŁAWOMIR LASOTA. „Relating timed and register automata“. Mathematical Structures in Computer Science 26, Nr. 6 (05.12.2014): 993–1021. http://dx.doi.org/10.1017/s0960129514000322.

Der volle Inhalt der Quelle

Annotation:

Timed and register automata are well-known models of computation over timed and data words, respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data values for later comparison. Although these two models behave differently in appearance, several decision problems have the same (un)decidability and complexity results for both models. As a prominent example, emptiness is decidable for alternating automata with one clock or register, both with non-primitive recursive complexity. This is not by chance.This work confirms that there is indeed a tight relationship between the two models. We show that a run of a timed automaton can be simulated by a register automaton over ordered data domain, and conversely that a run of a register automaton can be simulated by a timed automaton. These are exponential time reductions hold both in the finite and infinite words settings. Our results allow to transfer decidability results back and forth between these two kinds of models, as well complexity results modulo an exponential time reduction. We justify the usefulness of these reductions by obtaining new results on register automata.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Mutyalamma, G., K. Komali und G. Pushpa. „A Novel Algorithm for Reduction of Non-Deterministic Finite Automata“. International Journal of Trend in Scientific Research and Development Volume-2, Issue-1 (31.12.2017): 1341–46. http://dx.doi.org/10.31142/ijtsrd8233.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Timmer, Mark, Joost-Pieter Katoen, Jaco van de Pol und Mariëlle Stoelinga. „Confluence reduction for Markov automata“. Theoretical Computer Science 655 (Dezember 2016): 193–219. http://dx.doi.org/10.1016/j.tcs.2016.01.017.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Dauchet, Max, Anne-Cécile Caron und Jean-Luc Coquidé. „Automata for Reduction Properties Solving“. Journal of Symbolic Computation 20, Nr. 2 (August 1995): 215–33. http://dx.doi.org/10.1006/jsco.1995.1048.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Kleinert, Tobias, Frederik Zahn und Veit Hagenmeyer. „On complexity reduction of the discrete-event subsystem of Flat Hybrid Automata for control design“. at - Automatisierungstechnik 68, Nr. 7 (26.07.2020): 529–40. http://dx.doi.org/10.1515/auto-2020-0061.

Der volle Inhalt der Quelle

Annotation:

AbstractThe class of hybrid systems describes most technical systems in great detail. However, the respective models and their behavior tend to be very complex. Recently, a new subclass of hybrid automata has been introduced, the Flat Hybrid Automata (FHA) that relies on the concepts of differential flatness for the continuous parts, and strongly connected automaton graphs for the discrete event part, in order to deal with the complexity from a design perspective. Therefore, we introduce in the present paper an approach to reduce the automaton graph of an FHA in a systematic way by removing edges from the adjacency matrix. The main contribution of the paper is twofold: Firstly, based on practical considerations we develop a heuristic algorithm to reduce the automaton graph. Secondly, we present possible ways to include knowledge about the system in the reduction.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Tamm, Hellis, Matti Nykänen und Esko Ukkonen. „On size reduction techniques for multitape automata“. Theoretical Computer Science 363, Nr. 2 (Oktober 2006): 234–46. http://dx.doi.org/10.1016/j.tcs.2006.07.027.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Peeva, Ketty G. „Behaviour, reduction and minimization of finite -automata“. Fuzzy Sets and Systems 28, Nr. 2 (November 1988): 171–81. http://dx.doi.org/10.1016/0165-0114(88)90198-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Kilibarda, Goran. „Reduction of automata in labyrinths and universal traps“. Publications de l'Institut Math?matique (Belgrade) 109, Nr. 123 (2021): 17–34. http://dx.doi.org/10.2298/pim2123017k.

Der volle Inhalt der Quelle

Annotation:

We consider the problem of searching labyrinths by colletives of independent automata and show that for such colletives it is possible to construct, by using reduction of automata, traps of various types even in the class of all finite mosaic labyrinths.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Vardi, Moshe Y. „A note on the reduction of two-way automata to one-way automata“. Information Processing Letters 30, Nr. 5 (März 1989): 261–64. http://dx.doi.org/10.1016/0020-0190(89)90205-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

KUTRIB, MARTIN, und FRIEDRICH OTTO. „ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA“. International Journal of Foundations of Computer Science 24, Nr. 06 (September 2013): 831–46. http://dx.doi.org/10.1142/s0129054113400212.

Der volle Inhalt der Quelle

Annotation:

The restarting automaton was inspired by the technique of ‘analysis by reduction’ from linguistics. A restarting automaton processes a given input word through a sequence of cycles. In each cycle the current word on the tape is scanned from left to right and a single local simplification (a rewrite) is executed. One of the essential parameters of a restarting automaton is the size of its read/write window. Here we study the impact of the window size on the descriptional complexity of several types of deterministic and nondeterministic restarting automata. For all k ≥ 4, we show that the savings in the economy of descriptions of restarting automata that can only delete symbols but not rewrite them (that is, the so-called R- and RR-automata) cannot be bounded by any recursive function, when changing from window size k to window size k + 1. This holds for deterministic as well as for nondeterministic automata, and for k ≥ 5, it even holds for the stateless variants of these automata. However, the trade-off between window sizes two and one is recursive for deterministic devices. In addition, a polynomial upper bound is given for the trade-off between RRWW-automata with window sizes k + 1 and k for all k ≥ 2.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

ABDULLA, PAROSH AZIZ, AHMED BOUAJJANI, LUKÁŠ HOLÍK, LISA KAATI und TOMÁŠ VOJNAR. „COMPOSED BISIMULATION FOR TREE AUTOMATA“. International Journal of Foundations of Computer Science 20, Nr. 04 (August 2009): 685–700. http://dx.doi.org/10.1142/s0129054109006814.

Der volle Inhalt der Quelle

Annotation:

We address the problem of reducing the size of (nondeterministic, bottom-up) tree automata (TA) using suitable, language-preserving equivalences on the states of the automata. In particular, we propose the so-called composed bisimulation equivalence as a new language preserving equivalence. A composed bisimulation equivalence is defined in terms of two different relations, namely the upward and downward bisimulation equivalence. We provide simple and efficient algorithms for computing these relations. The notion of composed bisimulation equivalence is motivated by an attempt to obtain an equivalence that can provide better reductions than what currently known bisimulation-based approaches can offer, but which is not significantly more difficult to compute (and hence stays below the computational requirements of simulation-based reductions). The experimental results we present in the paper show that our composed bisimulation equivalence meets such requirements, and hence provides users of TA with a finer way to resolve the trade-off between the available degree of reduction and its cost.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Dahmoune, Mohamed, El Houcein El Abdalaoui und Djelloul Ziadi. „On the Transition Reduction Problem for Finite Automata“. Fundamenta Informaticae 132, Nr. 1 (2014): 79–94. http://dx.doi.org/10.3233/fi-2014-1033.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Lunze, Jan. „Complexity reduction in state observation of stochastic automata“. IFAC Proceedings Volumes 37, Nr. 18 (September 2004): 339–44. http://dx.doi.org/10.1016/s1474-6670(17)30769-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Abdulla, Parosh Aziz, Yu-Fang Chen, Lukáš Holík und Tomáš Vojnar. „Mediating for reduction (on minimizing alternating Büchi automata)“. Theoretical Computer Science 552 (Oktober 2014): 26–43. http://dx.doi.org/10.1016/j.tcs.2014.08.003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Kuniba, Atsuo, Taichiro Takagi und Akira Takenouchi. „Factorization, reduction and embedding in integrable cellular automata“. Journal of Physics A: Mathematical and General 37, Nr. 5 (19.01.2004): 1691–709. http://dx.doi.org/10.1088/0305-4470/37/5/015.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Mariot, Luca, Luca Manzoni und Alberto Dennunzio. „Search space reduction of asynchrony immune cellular automata“. Natural Computing 19, Nr. 2 (27.04.2020): 287–93. http://dx.doi.org/10.1007/s11047-020-09788-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Ćirić, Miroslav, Aleksandar Stamenković, Jelena Ignjatović und Tatjana Petković. „Fuzzy relation equations and reduction of fuzzy automata“. Journal of Computer and System Sciences 76, Nr. 7 (November 2010): 609–33. http://dx.doi.org/10.1016/j.jcss.2009.10.015.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

MANUEL, AMALDEV, und R. RAMANUJAM. „CLASS COUNTING AUTOMATA ON DATAWORDS“. International Journal of Foundations of Computer Science 22, Nr. 04 (Juni 2011): 863–82. http://dx.doi.org/10.1142/s0129054111008465.

Der volle Inhalt der Quelle

Annotation:

In the theory of automata over infinite alphabets, a central difficulty is that of finding a suitable compromise between expressiveness and algorithmic complexity. We propose an automaton model where we count the multiplicity of data values on an input word. This is particularly useful when such languages represent behaviour of systems with unboundedly many processes, where system states carry such counts as summaries. A typical recognizable language is: "every process does at most k actions labelled a". We show that emptiness is elementarily decidable, by reduction to the covering problem on Petri nets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Hadriche, Abir, Nawel Jmail, Hamadi Ghariani, Abdennaceur Kachouri und Laurent Pezard. „Reduction of Continuous Neuronal Model to Discrete Binary Automata“. International Journal of Computer Applications 69, Nr. 24 (31.05.2013): 5–10. http://dx.doi.org/10.5120/12116-8140.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Peeva, Kety. „Equivalence, reduction and minimization of finite automata over semirings“. Theoretical Computer Science 88, Nr. 2 (Oktober 1991): 269–85. http://dx.doi.org/10.1016/0304-3975(91)90377-e.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Lohrey, Markus, Sebastian Maneth und Manfred Schmidt-Schauß. „Parameter reduction and automata evaluation for grammar-compressed trees“. Journal of Computer and System Sciences 78, Nr. 5 (September 2012): 1651–69. http://dx.doi.org/10.1016/j.jcss.2012.03.003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Labbé, Sébastien, und Jean-Pierre Gallois. „Slicing communicating automata specifications: polynomial algorithms for model reduction“. Formal Aspects of Computing 20, Nr. 6 (13.08.2008): 563–95. http://dx.doi.org/10.1007/s00165-008-0086-3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

EPSTEIN, D. B. A., und P. J. SANDERS. „KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES“. International Journal of Algebra and Computation 10, Nr. 05 (Oktober 2000): 539–89. http://dx.doi.org/10.1142/s0218196700000352.

Der volle Inhalt der Quelle

Annotation:

We introduce a new class of groups with solvable word problem, namely groups specified by a confluent set of short-lex-reducing Knuth–Bendix rules which form a regular language. This simultaneously generalizes short-lex-automatic groups and groups with a finite confluent set of short-lex-reducing rules. We describe a computer program which looks for such a set of rules in an arbitrary finitely presented group. Our main theorem is that our computer program finds the set of rules, if it exists, given enough time and space. (This is an optimistic description of our result — for the more pessimistic details, see the body of the paper.) The set of rules is embodied in a finite state automaton in two variables. A central feature of our program is an operation, which we call welding, used to combine existing rules with new rules as they are found. Welding can be defined on arbitrary finite state automata, and we investigate this operation in abstract, proving that it can be considered as a process which takes as input one regular language and outputs another regular language. In our programs we need to convert several nondeterministic finite state automata to deterministic versions accepting the same language. We show how to improve somewhat on the standard subset construction, due to special features in our case. We axiomatize these special features, in the hope that these improvements can be used in other applications. The Knuth–Bendix process normally spends most of its time in reduction, so its efficiency depends on doing reduction quickly. Standard data structures for doing this can become very large, ultimately limiting the set of presentations of groups which can be so analyzed. We are able to give a method for rapid reduction using our much smaller two variable automaton, encoding the (usually infinite) regular language of rules found so far. Time taken for reduction in a given group is a small constant times the time taken for reduction in the best schemes known (see [5]), which is not too bad since we are reducing with respect to an infinite set of rules, whereas known schemes use a finite set of rules. We hope that the method described here might lead to the computation of automatic structures in groups for which this is currently infeasible. Some proofs have been omitted from this paper in the interests of brevity. Full details are provided in [4].

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Kim, Tai-Suk, und Seok-Ki Lee. „Noise Reduction of Image Using Sequential Method of Cellular Automata“. Journal of information and communication convergence engineering 9, Nr. 2 (30.04.2011): 224–29. http://dx.doi.org/10.6109/jicce.2011.9.2.224.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Zhang, R., K. Walus, W. Wang und G. A. Jullien. „A Method of Majority Logic Reduction for Quantum Cellular Automata“. IEEE Transactions On Nanotechnology 3, Nr. 4 (Dezember 2004): 443–50. http://dx.doi.org/10.1109/tnano.2004.834177.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Pan, MinXue, You Li, Lei Bu und XuanDong Li. „Loop reduction techniques for reachability analysis of linear hybrid automata“. Science China Information Sciences 55, Nr. 12 (24.11.2012): 2663–74. http://dx.doi.org/10.1007/s11432-012-4726-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Stamenković, Aleksandar, Miroslav Ćirić und Jelena Ignjatović. „Reduction of fuzzy automata by means of fuzzy quasi-orders“. Information Sciences 275 (August 2014): 168–98. http://dx.doi.org/10.1016/j.ins.2014.02.028.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Sato, Shohei, und Hitoshi Kanoh. „Evolutionary Design of Cellular Automata for Noise Reduction of Grayscale Images“. Transactions of the Japanese Society for Artificial Intelligence 25 (2010): 311–19. http://dx.doi.org/10.1527/tjsai.25.311.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

CAPOBIANCO, SILVIO. „CELLULAR AUTOMATA OVER SEMI-DIRECT PRODUCT GROUPS: REDUCTION AND INVERTIBILITY RESULTS“. International Journal of Algebra and Computation 16, Nr. 06 (Dezember 2006): 1071–85. http://dx.doi.org/10.1142/s0218196706003402.

Der volle Inhalt der Quelle

Annotation:

Cellular automata are transformations of configuration spaces over finitely generated groups, such that the next state in a point only depends on the current state of a finite neighborhood of the point itself. Many questions arise about retrieving global properties from such local descriptions, and finding algorithms to perform these tasks. We consider the case when the group is a semi-direct product of two finitely generated groups, and show that a finite factor (whatever it is) can be thought of as part of the alphabet instead of the group, preserving both the dynamics and some "finiteness" properties. We also show that, under reasonable hypotheses, this reduction is computable: this leads to some reduction theorems related to the invertibility problem.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Češka, Milan, Vojtěch Havlena, Lukáš Holík, Ondřej Lengál und Tomáš Vojnar. „Approximate reduction of finite automata for high-speed network intrusion detection“. International Journal on Software Tools for Technology Transfer 22, Nr. 5 (24.05.2019): 523–39. http://dx.doi.org/10.1007/s10009-019-00520-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Stamenković, Aleksandar, Miroslav Ćirić und Milan Bašić. „Ranks of fuzzy matrices. Applications in state reduction of fuzzy automata“. Fuzzy Sets and Systems 333 (Februar 2018): 124–39. http://dx.doi.org/10.1016/j.fss.2017.05.028.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Etessami, Kousha, Thomas Wilke und Rebecca A. Schuller. „Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata“. SIAM Journal on Computing 34, Nr. 5 (Januar 2005): 1159–75. http://dx.doi.org/10.1137/s0097539703420675.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Kumar, Tapas, und G. Sahoo. „Implementation of cellular automata for impulsive noise reduction in grey scale images“. International Journal of Signal and Imaging Systems Engineering 7, Nr. 3 (2014): 152. http://dx.doi.org/10.1504/ijsise.2014.065261.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Yang, Chao, und Yongming Li. „Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures“. Fuzzy Sets and Systems 391 (Juli 2020): 72–95. http://dx.doi.org/10.1016/j.fss.2019.07.010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Wu, Lihua, und Daowen Qiu. „Automata theory based on complete residuated lattice-valued logic: Reduction and minimization“. Fuzzy Sets and Systems 161, Nr. 12 (Juni 2010): 1635–56. http://dx.doi.org/10.1016/j.fss.2009.12.011.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Ignjatovic, Jelena, und Miroslav Ciric. „Weakly linear systems of fuzzy relation inequalities and their applications: A brief survey“. Filomat 26, Nr. 2 (2012): 207–41. http://dx.doi.org/10.2298/fil1202207i.

Der volle Inhalt der Quelle

Annotation:

Weakly linear systems of fuzzy relation inequalities and equations have recently emerged from research in the theory of fuzzy automata. From the general aspect of the theory of fuzzy relation equations and inequalities homogeneous and heterogeneousweakly linear systems have been discussed in two recent papers. Here we give a brief overview of the main results from these two papers, as well as from a series of papers on applications of weakly linear systems in the state reduction of fuzzy automata, the study of simulation, bisimulation and equivalence of fuzzy automata, and in the social network analysis. Especially, we present algorithms for computing the greatest solutions to weakly linear systems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Athithan, Senthil, Vidya Prasad Shukla und Sangappa Ramachandra Biradar. „Dynamic Cellular Automata Based Epidemic Spread Model for Population in Patches with Movement“. Journal of Computational Environmental Sciences 2014 (12.02.2014): 1–8. http://dx.doi.org/10.1155/2014/518053.

Der volle Inhalt der Quelle

Annotation:

Epidemiology is the study of spread of diseases among the group of population. If not controlled properly, the epidemic would cause an enormous number of problems and lead to pandemic situation. Here in this paper we consider the situation of populated areas where people live in patches. A dynamic cellular automata model for population in patches is being proposed in this paper. This work not only explores the computing power of cellular automata in modeling the epidemic spread but also provides the pathway in reduction of computing time when using the dynamic cellular automata model for the patchy population when compared to the static cellular automata which is used for a nonpatchy homogeneous population. The variation of the model with movement of population among the patches is also explored which provides an efficient way for evacuation planning and vaccination of infected areas.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Boon, Jean Pierre, Christopher Bodenstein und David Hanon. „Class of Cellular Automata for the Formation of Surface Aggregates“. International Journal of Modern Physics C 09, Nr. 08 (Dezember 1998): 1559–66. http://dx.doi.org/10.1142/s0129183198001400.

Der volle Inhalt der Quelle

Annotation:

A class of cellular automata is constructed on the basis of a set of simple rules: virtual particles obeying a full exclusion principle are subject to probabilistic dynamics with nonlocal (attractive and repulsive) interactions, and with momentum transfer memory effects. Boundary conditions can be periodic or can be set to simulate open systems, with various geometries. This model system possesses the essential elements to simulate the formation of surface aggregates. A specific application is presented for the formation and the dynamics of islands of hydroxyl groups in the catalytic reduction of NO on a Pt surface. The comparison between the simulation results and the experimental observations by Field Ion Microscopy suggests possible mechanisms for the so-far unexplained formation and dynamics of hydroxyl islands during the NO reduction processes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Sen, Bibhash, Ayush Rajoria und Biplab K. Sikdar. „Design of Efficient Full Adder in Quantum-Dot Cellular Automata“. Scientific World Journal 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/250802.

Der volle Inhalt der Quelle

Annotation:

Further downscaling of CMOS technology becomes challenging as it faces limitation of feature size reduction. Quantum-dot cellular automata (QCA), a potential alternative to CMOS, promises efficient digital design at nanoscale. Investigations on the reduction of QCA primitives (majority gates and inverters) for various adders are limited, and very few designs exist for reference. As a result, design of adders under QCA framework is gaining its importance in recent research. This work targets developing multi-layered full adder architecture in QCA framework based on five-input majority gate proposed here. A minimum clock zone (2 clock) with high compaction (0.01 μm2) for a full adder around QCA is achieved. Further, the usefulness of such design is established with the synthesis of high-level logic. Experimental results illustrate the significant improvements in design level in terms of circuit area, cell count, and clock compared to that of conventional design approaches.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Beneš, N., L. Brim, B. Buhnova, I. Černá, J. Sochor und P. Vařeková. „Partial order reduction for state/event LTL with application to component-interaction automata“. Science of Computer Programming 76, Nr. 10 (Oktober 2011): 877–90. http://dx.doi.org/10.1016/j.scico.2010.02.008.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Sadeghi, Sana, Alireza Rezvanian und Ebrahim Kamrani. „An efficient method for impulse noise reduction from images using fuzzy cellular automata“. AEU - International Journal of Electronics and Communications 66, Nr. 9 (September 2012): 772–79. http://dx.doi.org/10.1016/j.aeue.2012.01.010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Mitra, Arnab, Anirban Kundu, Matangini Chattopadhyay und Samiran Chattopadhyay. „On the Exploration of Equal Length Cellular Automata Rules Targeting a MapReduce Design in Cloud“. International Journal of Cloud Applications and Computing 8, Nr. 2 (April 2018): 1–26. http://dx.doi.org/10.4018/ijcac.2018040101.

Der volle Inhalt der Quelle

Annotation:

A MapReduce design with Cellular Automata (CA) is presented in this research article to facilitate load-reduced independent data processing and cost-efficient physical implementation in heterogeneous Cloud architecture. Equal Length Cellular Automata (ELCA) are considered for the design. This article explores ELCA rules and presents an ELCA based MapReduce design in cloud. New algorithms are presented for i) synthesis, ii) classification of ELCA rules, and iii) ELCA based MapReduce design in Cloud. Shuffling and efficient reduction of data volume are ensured in proposed MapReduce design.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Jayalakshmi, R., M. Senthil Kumaran und R. Amutha. „A Step Towards Optimisation of 2 to 4 Decoder Using Farooq-Nikesh-Zaid Gate with Coplanar Crossing in Quantum Dot Cellular Automata“. Journal of Computational and Theoretical Nanoscience 17, Nr. 5 (01.05.2020): 2120–24. http://dx.doi.org/10.1166/jctn.2020.8857.

Der volle Inhalt der Quelle

Annotation:

The limitations of the existing Complementary Metal Oxide Semiconductor are leading the momentum to various new approaches like Quantum-dot Cellular Automata (QCA). QCA offers low power dissipation, less area and high switching speeds. The Majority Voter is the basic structure that votes out on the majority of the inputs to implement a Boolean Function. The QCA architectures are created by using majority gates with inverters or by using universal gates like AND–OR-Inverter and NAND–NOR-Inverter gate. This paper proposes a quantum-dot cellular automata 2 to 4 decoder using Universal Farooq-Nikesh-Zaid gate, which utilizes the NAND gate logic to implement the functionality. The design offers 33% reduction in the cell count, reduction in the area with Six Clock Phases in simple co planar wire crossing. The proposed design is validated using the QCA Designer tool.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

ALLAUZEN, CYRIL, CORINNA CORTES und MEHRYAR MOHRI. „A DUAL COORDINATE DESCENT ALGORITHM FOR SVMs COMBINED WITH RATIONAL KERNELS“. International Journal of Foundations of Computer Science 22, Nr. 08 (Dezember 2011): 1761–79. http://dx.doi.org/10.1142/s0129054111009021.

Der volle Inhalt der Quelle

Annotation:

This paper presents a novel application of automata algorithms to machine learning. It introduces the first optimization solution for support vector machines used with sequence kernels that is purely based on weighted automata and transducer algorithms, without requiring any specific solver. The algorithms presented apply to a family of kernels covering all those commonly used in text and speech processing or computational biology. We show that these algorithms have significantly better computational complexity than previous ones and report the results of large-scale experiments demonstrating a dramatic reduction of the training time, typically by several orders of magnitude.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Guimarães, Carlos, und Fernando Durão. „Application of a cellular automata based simulation model of size reduction in mineral processing“. Minerals Engineering 20, Nr. 6 (Mai 2007): 541–51. http://dx.doi.org/10.1016/j.mineng.2006.11.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Taherifard, Mohammad, und Mahmood Fathy. „Improving logic function synthesis, through wire crossing reduction in quantum‐dot cellular automata layout“. IET Circuits, Devices & Systems 9, Nr. 4 (Juli 2015): 265–74. http://dx.doi.org/10.1049/iet-cds.2014.0327.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

GARDEY, GUILLAUME, OLIVIER H. ROUX und OLIVIER F. ROUX. „State space computation and analysis of Time Petri Nets“. Theory and Practice of Logic Programming 6, Nr. 3 (Mai 2006): 301–20. http://dx.doi.org/10.1017/s147106840600264x.

Der volle Inhalt der Quelle

Annotation:

The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove the algorithm to be exact with respect to the reachability problem. Furthermore, we propose a translation of the computed state space into a Timed Automaton, proved to be timed bisimilar to the original Time Petri Net. As the method produce a single Timed Automaton, syntactical clocks reduction methods (DAWS and YOVINE for instance) may be applied to produce an automaton with fewer clocks. Then, our method allows to model-check T-TPN by the use of efficient Timed Automata tools.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!