Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Raghavan Rama"'
Autor:
Mohankumar, Sivasankar, Raghavan, Rama
Given an infinite word, enumerating its factors is an important exercise for understanding the structure of the word. The process of finding all the factors is quite tricky for two-dimensional words. In this paper, two possible ways of enumerating th
Externí odkaz:
http://arxiv.org/abs/2207.04304
A discontinuous model of computation called one-way jumping finite automata was defined by H. Chigahara et. al. This model was a restricted version of the model jumping finite automata. One-way jumping finite automata change their states after deleti
Externí odkaz:
http://arxiv.org/abs/2106.03852
A new discontinuous model of computation called one-way jumping finite automata was defined by H. Chigahara et. al. This model was a restricted version of the model jumping finite automata. These automata read an input symbol-by-symbol and jump only
Externí odkaz:
http://arxiv.org/abs/2106.02937
P systems with active membranes were used to generate languages, in the sense of languages associated with the structure of membrane systems. Here, we analyze the power of P systems with membrane creation and dissolution restricted to elementary memb
Externí odkaz:
http://arxiv.org/abs/1108.3431
Publikováno v:
In Computer Methods and Programs in Biomedicine May 2016 128:69-74
Publikováno v:
The Computer Journal. 65:1178-1188
A new model of computation called Watson–Crick jumping finite automata was introduced by Mahalingam et al., and the authors study the computing power and closure properties of the variants of the model. There are four variants of the model: no stat
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Iran Journal of Computer Science. 1:133-145
P systems with graph productions were introduced by Freund in 2004. It was shown that such a variant of P system can generate any recursively enumerable language of weakly connected graphs. In this paper, we consider such P systems where the input is
Autor:
Raghavan, Rama1, Hyter, Stephen2, Pathak, Harsh B.2, Godwin, Andrew K.2, Konecny, Gottfried3, Chen Wang4, Goode, Ellen L.4, Fridley, Brooke L.1 bfridley@kumc.edu
Publikováno v:
BMC Genomics. 10/19/2016, Vol. 17, p1-8. 8p. 1 Diagram, 2 Charts, 1 Graph.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.