Zaloguj się

Gotowe bibliografie tematyczne / Parallel Automata / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Parallel Automata.

Artykuły w czasopismach na temat „Parallel Automata”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 1 lutego 2022

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Parallel Automata”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

CSUHAJ-VARJÚ, ERZSÉBET, CARLOS MARTÍN-VIDE, VICTOR MITRANA i GYÖRGY VASZIL. "PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS". International Journal of Foundations of Computer Science 11, nr 04 (grudzień 2000): 631–50. http://dx.doi.org/10.1142/s0129054100000338.

Pełny tekst źródła

Streszczenie:

We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request, using a communication strategy borrowed from grammar system theory. We investigate the computational power of these mechanisms. We prove that non-centralized parallel communicating pushdown automata systems with a bounded number of components, where each automaton is allowed to issue a query, are able to recognize all recursively enumerable languages. We also present homomorphical characterizations of the class of recursively enumerable languages for the centralized variants, where only a distinguished automaton issues queries. Moreover, we show that these centralized variants are at least as powerful as one-way multihead pushdown automata. Finally, some open problems and further directions of research are discussed.

Style APA, Harvard, Vancouver, ISO itp.

2

Subramaniyan, Arun, i Reetuparna Das. "Parallel Automata Processor". ACM SIGARCH Computer Architecture News 45, nr 2 (14.09.2017): 600–612. http://dx.doi.org/10.1145/3140659.3080207.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Tachon, Thibaut, Chong Li, Gaétan Hains i Frédéric Loulergue. "Automated Generation of BSP Automata". Parallel Processing Letters 27, nr 01 (marzec 2017): 1740002. http://dx.doi.org/10.1142/s0129626417400023.

Pełny tekst źródła

Streszczenie:

Bulk-Synchronous Parallel (BSP) is a bridging model between abstract execution and concrete parallel architectures that retains enough information to model performance scalability. In order to model BSP program executions, Hains adapted the theory of finite automata to the BSP paradigm by introducing BSP automata [12]. In the initial description of the theory, BSP automata had to be explicitly defined as structured sets of states and transitions. The lack of a clean and efficient algorithm for generating them from regular expressions would have prevented this theory from being used in practice. To alleviate this problem we introduce in this paper an algorithm that generates a BSP automaton recognizing a BSP language defined by a BSP regular expression. The main practical use of BSP automata developed in this paper is the parallelization of finite state automata with an explicit distribution and a performance model, that enable parallel matching of regular expressions. Secondarily, BSP regular expressions provide a convenient structure for automatic code generation of imperative BSP programs that is also developed in this paper.

Style APA, Harvard, Vancouver, ISO itp.

4

CANTONE, DOMENICO, i SIMONE FARO. "A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM". International Journal of Foundations of Computer Science 17, nr 06 (grudzień 2006): 1235–51. http://dx.doi.org/10.1142/s0129054106004388.

Pełny tekst źródła

Streszczenie:

Finite (nondeterministic) automata are very useful building blocks in the field of string matching. This is particularly true in the case of multiple pattern matching, where the use of factor-based automata can reduce substantially the number of computational steps when the patterns have large common factors. Direct simulation of nondeterministic automata can be performed very efficiently using the bit-parallelism technique, though this is not necessarily true for factor-based automata. In this paper we present an algorithm for the multiple string matching problem, based on the bit-parallel simulation of nondeterministic factor-based automata which satisfy a particular ordering condition. We also show how to enforce such condition by suitably modifying a minimal initial automaton, through equivalence preserving transformations. The resulting automaton turns out to be smaller than the corresponding maximal automata used by existing bit-parallel algorithms, as they do not take any advantage of common factors in patterns.

Style APA, Harvard, Vancouver, ISO itp.

5

Bruchertseifer, Jens, i Henning Fernau. "Synchronizing series-parallel deterministic finite automata with loops and related problems". RAIRO - Theoretical Informatics and Applications 55 (2021): 7. http://dx.doi.org/10.1051/ita/2021005.

Pełny tekst źródła

Streszczenie:

We study the problem DFA-SW of determining if a given deterministic finite automaton A possesses a synchronizing word of length at most k for automata whose (multi-)graphs are TTSPL, i.e., series-parallel, plus allowing some self-loops. While DFA-SW remains NP-complete on TTSPL automata, we also find (further) restrictions with efficient (parameterized) algorithms. We also study the (parameterized) complexity of related problems, for instance, extension variants of the synchronizing word problem, or the problem of finding smallest alphabet-induced synchronizable sub-automata.

Style APA, Harvard, Vancouver, ISO itp.

6

LI, GUOQIANG, XIAOJUAN CAI i SHOJI YUEN. "MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS". International Journal of Foundations of Computer Science 23, nr 04 (czerwiec 2012): 831–51. http://dx.doi.org/10.1142/s0129054112400382.

Pełny tekst źródła

Streszczenie:

Timed automata are commonly recognized as a formal behavioral model for real-time systems. For compositional system design, parallel composition of timed automata as proposed by Larsen et al. [22] is useful. Although parallel composition provides a general method for system construction, in the low level behavior, components often behave sequentially by passing control via communication. This paper proposes a behavioral model, named controller automata, to combine timed automata by focusing on the control passing between components. In a controller automaton, to each state a timed automaton is assigned. A timed automaton at a state may be preempted by the control passing to another state by a global labeled transition. A controller automaton properly extends the expressive power because of the stack, but this can make the reachability problem undecidable. Given a strict partial order over states, we show that this problem can be avoided and a controller automaton can be faithfully translated into a timed automaton.

Style APA, Harvard, Vancouver, ISO itp.

7

TORBEY, SAMI. "TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA". Parallel Processing Letters 19, nr 01 (marzec 2009): 73–83. http://dx.doi.org/10.1142/s0129626409000079.

Pełny tekst źródła

Streszczenie:

The ability to obtain complex global behaviour from simple local rules makes cellular automata an interesting platform for massively parallel computation. However, manually designing a cellular automaton to perform a given computation can be extremely difficult, and automated design techniques such as genetic programming have their limitations because of the absence of human intuition. In this paper, we propose elements of a framework whose goal is to make the manual synthesis of cellular automata rules exhibiting desired global characteristics more programmer-friendly, while maintaining the simplicity of local processing elements. Although many of the framework elements that we describe here are not new, we group them into a consistent framework and show that they can all be implemented on a traditional cellular automaton, which means that they are merely more human-friendly ways of describing simple cellular automata rules, and not foreign structures that require changing the traditional cellular automaton model.

Style APA, Harvard, Vancouver, ISO itp.

8

Morales, D. G., F. Almeida, C. Rodrı́guez, J. L. Roda, I. Coloma i A. Delgado. "Parallel dynamic programming and automata theory". Parallel Computing 26, nr 1 (styczeń 2000): 113–34. http://dx.doi.org/10.1016/s0167-8191(99)00098-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Vollweiler, Marcel, i Friedrich Otto. "Systems of parallel communicating restarting automata". RAIRO - Theoretical Informatics and Applications 48, nr 1 (styczeń 2014): 3–22. http://dx.doi.org/10.1051/ita/2013046.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Bordihn, Henning, i György Vaszil. "Reversible parallel communicating finite automata systems". Acta Informatica 58, nr 4 (19.07.2021): 263–79. http://dx.doi.org/10.1007/s00236-021-00396-9.

Pełny tekst źródła

Streszczenie:

AbstractWe study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.

Style APA, Harvard, Vancouver, ISO itp.

11

MARTÍN-VIDE, CARLOS, ALEXANDRU MATEESCU i VICTOR MITRANA. "PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES". International Journal of Foundations of Computer Science 13, nr 05 (październik 2002): 733–49. http://dx.doi.org/10.1142/s0129054102001424.

Pełny tekst źródła

Streszczenie:

An accepting device based on the communication between finite automata working in parallel is introduced. It consists of several finite automata working independently but communicating states to each other by request. Several variants of parallel communicating finite automata systems are investigated from their computational power point of view. We prove that all of them are at most as powerful as multi-head finite automata. Homomorphical characterizations of recursively enumerable languages are obtained starting from languages recognized by all variants of parallel communicating finite automata systems having at most three components. We present a brief comparison with the parallel communicating grammar systems. Some remarks suggesting that these devices might be mildly context-sensitive ones as well as a few open problems and directions for further research are also discussed.

Style APA, Harvard, Vancouver, ISO itp.

12

Otto, Friedrich. "Asynchronous Parallel Communicating Systems of Pushdown Automata". International Journal of Foundations of Computer Science 26, nr 05 (sierpień 2015): 643–66. http://dx.doi.org/10.1142/s0129054115500367.

Pełny tekst źródła

Streszczenie:

We introduce asynchronous variants of the parallel communicating systems of pushdown automata of Csuhaj-Varjú et al. These are obtained by using a response symbol in addition to the usual query symbols. Our main result states that centralized asynchronous parallel communicating systems of pushdown automata of degree n that work in returning mode have exactly the same expressive power as n-head pushdown automata. This holds in the nondeterministic as well as in the deterministic case. In addition, it is shown that the class of binary relations that is computed by centralized asynchronous parallel communicating systems of pushdown automata of degree two that are working in returning mode coincides with the class of pushdown relations.

Style APA, Harvard, Vancouver, ISO itp.

13

BORDIHN, HENNING, MARTIN KUTRIB i ANDREAS MALCHER. "UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA". International Journal of Foundations of Computer Science 22, nr 07 (listopad 2011): 1577–92. http://dx.doi.org/10.1142/s0129054111008891.

Pełny tekst źródła

Streszczenie:

Parallel communicating finite automata (PCFAs) are systems of several finite state automata which process a common input string in a parallel way and are able to communicate by sending their states upon request. We consider deterministic and nondeterministic variants and distinguish four working modes. It is known that these systems in the most general mode are as powerful as one-way multi-head finite automata. It is additionally known that the number of heads corresponds to the number of automata in PCFAs in a constructive way. Thus, undecidability results as well as results on the hierarchies induced by the number of heads carry over from multi-head finite automata to PCFAs in the most general mode. Here, we complement these undecidability and hierarchy results also for the remaining working modes. In particular, we show that classical decidability questions are not semi-decidable for any type of PCFAs under consideration. Moreover, it is proven that the number of automata in the system induces infinite hierarchies for deterministic and nondeterministic PCFAs in three working modes.

Style APA, Harvard, Vancouver, ISO itp.

14

Moreira, Nelma, i Rogério Reis. "Series-Parallel Automata and Short Regular Expressions". Fundamenta Informaticae 91, nr 3-4 (2009): 611–29. http://dx.doi.org/10.3233/fi-2009-0061.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Vollweiler, Marcel. "Asynchronous Systems of Parallel Communicating Finite Automata". Fundamenta Informaticae 136, nr 1-2 (2015): 177–97. http://dx.doi.org/10.3233/fi-2015-1149.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Spezzano, Giandomenico, i Domenico Talia. "Programming cellular automata algorithms on parallel computers". Future Generation Computer Systems 16, nr 2-3 (grudzień 1999): 203–16. http://dx.doi.org/10.1016/s0167-739x(99)00047-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Bordihn, Henning, Martin Kutrib i Andreas Malcher. "Measuring Communication in Parallel Communicating Finite Automata". Electronic Proceedings in Theoretical Computer Science 151 (21.05.2014): 124–38. http://dx.doi.org/10.4204/eptcs.151.8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Jastrzab, Tomasz. "On Parallel Induction of Nondeterministic Finite Automata". Procedia Computer Science 80 (2016): 257–68. http://dx.doi.org/10.1016/j.procs.2016.05.318.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

El-Fakih, Khaled, Nina Yevtushenko, Sergey Buffalov i Gregor v. Bochmann. "Progressive solutions to a parallel automata equation". Theoretical Computer Science 362, nr 1-3 (październik 2006): 17–32. http://dx.doi.org/10.1016/j.tcs.2006.05.034.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Thathachar, M. A. L., i M. T. Arvind. "Parallel algorithms for modules of learning automata". IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 28, nr 1 (1998): 24–33. http://dx.doi.org/10.1109/3477.658575.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Goldberg, Robert R., i Jerry Waxman. "Parallel decision procedures for finite state automata". International Journal of Computer Mathematics 49, nr 1-2 (styczeń 1993): 33–40. http://dx.doi.org/10.1080/00207169308804213.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Plateau, B., i K. Atif. "Stochastic automata network of modeling parallel systems". IEEE Transactions on Software Engineering 17, nr 10 (1991): 1093–108. http://dx.doi.org/10.1109/32.99196.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Avdeev, N. A., P. N. Bibilo i V. I. Romanov. "Verification and Scheme Implementation of Parallel Automata". Russian Microelectronics 49, nr 1 (styczeń 2020): 62–75. http://dx.doi.org/10.1134/s1063739719060027.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Ibarra, Oscar H., Michael A. Palis i Sam M. Kim. "Fast parallel language recognition by cellular automata". Theoretical Computer Science 41 (1985): 231–46. http://dx.doi.org/10.1016/0304-3975(85)90073-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Hirst, Tirza. "A Rice-style theorem for parallel automata". Information and Computation 207, nr 1 (styczeń 2009): 1–13. http://dx.doi.org/10.1016/j.ic.2008.10.004.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Tošic, Predrag T. "Cellular Automata Communication Models". International Journal of Natural Computing Research 1, nr 3 (lipiec 2010): 66–84. http://dx.doi.org/10.4018/jncr.2010070105.

Pełny tekst źródła

Streszczenie:

In this paper, cellular automata (CA) are viewed as an abstract model for distributed computing. The author argues that the classical CA model must be modified in several important respects to become a relevant model for large-scale MAS. The paper first proposes sequential cellular automata (SCA) and formalizes deterministic and nondeterministic versions of SCA. The author then analyzes differences in possible dynamics between classical parallel CA and various SCA models. The analysis in this paper focuses on one-dimensional parallel and sequential CA with node update rules restricted to simple threshold functions, as arguably the simplest totalistic, yet non-linear (and non-affine) update rules. The author identifies properties of asymptotic dynamics that can be proven to be entirely due to the assumption of perfect synchrony in classical, parallel CA. Finally, the paper discusses what an appropriate CA-based abstraction would be for large-scale distributed computing, insofar as the inter-agent communication models. In that context, the author proposes genuinely asynchronous CA and discusses main differences between genuinely asynchronous CA and various weakly asynchronous sequential CA models found in the literature.

Style APA, Harvard, Vancouver, ISO itp.

27

BAETEN, JOS C. M., BAS LUTTIK, TIM MULLER i PAUL VAN TILBURG. "Expressiveness modulo bisimilarity of regular expressions with parallel composition". Mathematical Structures in Computer Science 26, nr 6 (2.01.2015): 933–68. http://dx.doi.org/10.1017/s0960129514000309.

Pełny tekst źródła

Streszczenie:

The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness modulo bisimilarity. Then, we prove that replacing the operation for pure interleaving by ACP-style parallel composition gives a further increase in expressiveness, still insufficient, however, to facilitate the expression of all finite automata up to bisimilarity. Finally, we prove that the theory of regular expressions with ACP-style parallel composition and encapsulation is expressive enough to express all finite automata up to bisimilarity. Our results extend the expressiveness results obtained by Bergstra, Bethke and Ponse for process algebras with (the binary variant of) Kleene's star operation.

Style APA, Harvard, Vancouver, ISO itp.

28

Sun, Feng Wei, i Li Juan Yuan. "Study on the Modeling Method of Software Process Based on Timing and Parallel Automata". Advanced Materials Research 765-767 (wrzesień 2013): 1537–40. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.1537.

Pełny tekst źródła

Streszczenie:

The finite automata theory extended and then the timing parallel automata theory is got and applied in the software process modeling. The establishment of group software process model is on the basis of timing parallel automata which realize the activity planning, resource allocation and progress control of process. The process model has been checked rationality and the rationality definition and check rules have been given. The process modeling method in this paper is intuitive, easy to understand and could describe the dynamic change of process, and also present the concurrent activity and provide the effective support to parallel work and cooperative work.

Style APA, Harvard, Vancouver, ISO itp.

29

BRESLAUER, DANY, i RAMESH HARIHARAN. "OPTIMAL PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA". Parallel Processing Letters 06, nr 01 (marzec 1996): 35–44. http://dx.doi.org/10.1142/s0129626496000054.

Pełny tekst źródła

Streszczenie:

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees.

Style APA, Harvard, Vancouver, ISO itp.

30

Nguyễn, Trường Huy. "Automata Technique for The LCS Problem". Journal of Computer Science and Cybernetics 35, nr 1 (18.03.2019): 21–37. http://dx.doi.org/10.15625/1813-9663/35/1/13293.

Pełny tekst źródła

Streszczenie:

In this paper, we introduce two eﬃcient algorithms in practice for computing the length of a longest common subsequence of two strings, using automata technique, in sequential and parallel ways. For two input strings of lengths m and n with m ≤ n, the parallel algorithm uses k processors (k ≤ m) and costs time complexity O(n) in the worst case, where k is an upper estimate of the length of a longest common subsequence of the two strings. These results are based on the Knapsack Shaking approach proposed by P. T. Huy et al. in 2002. Experimental results show that for the alphabet of size 256, our sequential and parallel algorithms are about 65.85 and 3.41m times faster than the standard dynamic programming algorithm proposed by Wagner and Fisher in 1974, respectively.

Style APA, Harvard, Vancouver, ISO itp.

31

Cho, Sang, i Dung T. Huynh. "The parallel complexity of finite-state automata problems". Information and Computation 97, nr 1 (marzec 1992): 1–22. http://dx.doi.org/10.1016/0890-5401(92)90002-w.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Seredynski, F., i A. Y. Zomaya. "Sequential and parallel cellular automata-based scheduling algorithms". IEEE Transactions on Parallel and Distributed Systems 13, nr 10 (październik 2002): 1009–23. http://dx.doi.org/10.1109/tpds.2002.1041877.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Kucharska, Edyta, Katarzyna Grobler-Dębska, Krzysztof Rączka i Lidia Dutkiewicz. "Cellular Automata approach for parallel machine scheduling problem". SIMULATION 92, nr 2 (14.01.2016): 165–78. http://dx.doi.org/10.1177/0037549715625120.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Sipper, Moshe, Marco Tomassini i Mathieu S. Capcarrere. "Designing cellular automata using a parallel evolutionary algorithm". Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment 389, nr 1-2 (kwiecień 1997): 278–83. http://dx.doi.org/10.1016/s0168-9002(97)89460-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Phipps, M., i A. Langlois. "Spatial dynamics, cellular automata, and parallel processing computers". Environment and Planning B: Planning and Design 24, nr 2 (1997): 193–204. http://dx.doi.org/10.1068/b240193.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Crochemore, Maxime, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon i Alejandro Salinger. "Bit-parallel (δ,γ)-matching and suffix automata". Journal of Discrete Algorithms 3, nr 2-4 (czerwiec 2005): 198–214. http://dx.doi.org/10.1016/j.jda.2004.08.005.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Crochemore, Maxime, i Wojciech Rytter. "Parallel construction of minimal suffix and factor automata". Information Processing Letters 35, nr 3 (lipiec 1990): 121–28. http://dx.doi.org/10.1016/0020-0190(90)90060-b.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Stotts, P. David, i William Pugh. "Parallel finite automata for modeling concurrent software systems". Journal of Systems and Software 27, nr 1 (październik 1994): 27–43. http://dx.doi.org/10.1016/0164-1212(94)90112-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Jastrzab, Tomasz, Zbigniew J. Czech i Wojciech Wieczorek. "Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference". Fundamenta Informaticae 178, nr 3 (15.01.2021): 203–27. http://dx.doi.org/10.3233/fi-2021-2004.

Pełny tekst źródła

Streszczenie:

The goal of this paper is to develop the parallel algorithms that, on input of a learning sample, identify a regular language by means of a nondeterministic finite automaton (NFA). A sample is a pair of finite sets containing positive and negative examples. Given a sample, a minimal NFA that represents the target regular language is sought. We define the task of finding an NFA, which accepts all positive examples and rejects all negative ones, as a constraint satisfaction problem, and then propose the parallel algorithms to solve the problem. The results of comprehensive computational experiments on the variety of inference tasks are reported. The question of minimizing an NFA consistent with a learning sample is computationally hard.

Style APA, Harvard, Vancouver, ISO itp.

40

HERNANDEZ, GONZALO, HANS J. HERRMANN i ERIC GOLES. "EXTREMAL AUTOMATA FOR IMAGE SHARPENING". International Journal of Modern Physics C 05, nr 06 (grudzień 1994): 923–31. http://dx.doi.org/10.1142/s0129183194001057.

Pełny tekst źródła

Streszczenie:

We study numerically the parallel iteration of Extremal Rules. For four Extremal Rules, conceived for sharpening algorithms for image processing, we measured, on the square lattice with Von Neumann neighborhood and free boundary conditions, the typical transient length, the loss of information and the damage spreading response considering random and smoothening random damage. The same qualitative behavior was found for all the rules, with no noticeable finite size effect. They have a fast logarithmic convergence towards the fixed points of the parallel update. The linear damage spreading response has no discontinuity at zero damage, for both kinds of damage. Three of these rules produce similar effects. We propose these rules as sharpening algorithms for image processing.

Style APA, Harvard, Vancouver, ISO itp.

41

MORITA, KENICHI, SATOSHI UENO i KATSUNOBU IMAI. "CHARACTERIZING THE ABILITY OF PARALLEL ARRAY GENERATORS ON REVERSIBLE PARTITIONED CELLULAR AUTOMATA". International Journal of Pattern Recognition and Artificial Intelligence 13, nr 04 (czerwiec 1999): 523–38. http://dx.doi.org/10.1142/s0218001499000318.

Pełny tekst źródła

Streszczenie:

A PCAAG introduced by Morita and Ueno is a parallel array generator on a partitioned cellular automaton (PCA) that generates an array language (i.e. a set of symbol arrays). A "reversible" PCAAG (RPCAAG) is a backward deterministic PCAAG, and thus parsing of two-dimensional patterns can be performed without backtracking by an "inverse" system of the RPCAAG. Hence, a parallel pattern recognition mechanism on a deterministic cellular automaton can be directly obtained from a RPCAAG that generates the pattern set. In this paper, we investigate the generating ability of RPCAAGs and their subclass. It is shown that the ability of RPCAAGs is characterized by two-dimensional deterministic Turing machines, i.e. they are universal in their generating ability. We then investigate a monotonic RPCAAG (MRPCAAG), which is a special type of an RPCAAG that satisfies monotonic constraint. We show that the generating ability of MRPCAAGs is exactly characterized by two-dimensional deterministic linear-bounded automata.

Style APA, Harvard, Vancouver, ISO itp.

42

Balan, M. Sakthi. "Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems". Electronic Proceedings in Theoretical Computer Science 3 (30.07.2009): 59–68. http://dx.doi.org/10.4204/eptcs.3.5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Hecker, C., D. Roytenberg, J. R. Sack i Z. Wang. "System development for parallel cellular automata and its applications". Future Generation Computer Systems 16, nr 2-3 (grudzień 1999): 235–47. http://dx.doi.org/10.1016/s0167-739x(99)00049-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Das, Debasis, i Rajiv Misra. "Programmable Cellular Automata Based Efficient Parallel AES Encryption Algorithm". International Journal of Network Security & Its Applications 3, nr 6 (30.11.2011): 197–211. http://dx.doi.org/10.5121/ijnsa.2011.3615.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Soreni, Michal, Sivan Yogev, Elizaveta Kossoy, Yuval Shoham i Ehud Keinan. "Parallel Biomolecular Computation on Surfaces with Advanced Finite Automata". Journal of the American Chemical Society 127, nr 11 (marzec 2005): 3935–43. http://dx.doi.org/10.1021/ja047168v.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Yih-Lang Li i Cheng-Wen Wu. "Cellular automata for efficient parallel logic and fault simulation". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14, nr 6 (czerwiec 1995): 740–49. http://dx.doi.org/10.1109/43.387734.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Giordano, Andrea, Alessio De Rango, Rocco Rongo, Donato D'Ambrosio i William Spataro. "Dynamic Load Balancing in Parallel Execution of Cellular Automata". IEEE Transactions on Parallel and Distributed Systems 32, nr 2 (1.02.2021): 470–84. http://dx.doi.org/10.1109/tpds.2020.3025102.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

INOUE, KATSUSHI, ITSUO SAKURAMOTO, MAKOTO SAKAMOTO i ITSUO TAKANAMI. "TWO TOPICS CONCERNING TWO-DIMENSIONAL AUTOMATA OPERATING IN PARALLEL". International Journal of Pattern Recognition and Artificial Intelligence 06, nr 02n03 (sierpień 1992): 211–25. http://dx.doi.org/10.1142/s0218001492000126.

Pełny tekst źródła

Streszczenie:

This paper deals with two topics concerning two-dimensional automata operating in parallel. We first investigate a relationship between the accepting powers of two-dimensional alternating finite automata (2-AFAs) and nondeterministic bottom-up pyramid cellular acceptors (NUPCAs), and show that Ω ( diameter × log diameter ) time is necessary for NUPCAs to simulate 2-AFAs. We then investigate space complexity of two-dimensional alternating Turing machines (2-ATMs) operating in small space, and show that if L (n) is a two-dimensionally space-constructible function such that lim n → ∞ L (n)/ loglog n > 1 and L (n) ≤ log n, and L′ (n) is a function satisfying L′ (n) =o (L(n)), then there exists a set accepted by some strongly L (n) space-bounded two-dimensional deterministic Turing machine, but not accepted by any weakly L′ (n) space-bounded 2-ATM, and thus there exists a rich space hierarchy for weakly S (n) space-bounded 2-ATMs with loglog n ≤ S (n) ≤ log n.

Style APA, Harvard, Vancouver, ISO itp.

49

Martı́n-Vide, Carlos, i Victor Mitrana. "Some undecidable problems for parallel communicating finite automata systems". Information Processing Letters 77, nr 5-6 (marzec 2001): 239–45. http://dx.doi.org/10.1016/s0020-0190(00)00159-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Hoe, David H. K., Jonathan M. Comer, Juan C. Cerda, Chris D. Martinez i Mukul V. Shirvaikar. "Cellular Automata-Based Parallel Random Number Generators Using FPGAs". International Journal of Reconfigurable Computing 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/219028.

Pełny tekst źródła

Streszczenie:

Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA), which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs) for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs) using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA) uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR). This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehardis used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehardtests.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!