Zobrazeno 1 - 10
of 24
pro vyhledávání: '"V. Rajkumar Dare"'
Publikováno v:
ICTACT Journal on Soft Computing, Vol 6, Iss 4, Pp 1297-1301 (2016)
In this paper we study the Generalized Parikh Vector of words over three letter alphabet. For S = {a, b, c} the GPVs of words lie in the tetrahedron whose vertices are (1, 0, 0), (0, 1, 0), (0, 0, 1) and (0, 0, 0). All GPVs of words of equal length l
Externí odkaz:
https://doaj.org/article/f7963ab762a1445ea920cce273c7dc5e
Publikováno v:
ICTACT Journal on Soft Computing, Vol 7, Iss 4, Pp 1492-1497 (2017)
We have introduced a new operation called the superimposition operation. The translucent language generated by a given superimposition operation and a language L is the set of words generated by the superimposition of any two words in L. In this pape
Externí odkaz:
https://doaj.org/article/17aa871e8f644ab6ac957efee5a549bd
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031236112
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f1b825b12b009f4129729604cd352e5
https://doi.org/10.1007/978-3-031-23612-9_11
https://doi.org/10.1007/978-3-031-23612-9_11
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031236112
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ba867868589d5a5a028f514e65d3136
https://doi.org/10.1007/978-3-031-23612-9_14
https://doi.org/10.1007/978-3-031-23612-9_14
Publikováno v:
Neural Networks, Machine Learning, and Image Processing ISBN: 9781003303053
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df5740780e4e974ebaf32ef4ce37c026
https://doi.org/10.1201/9781003303053-13
https://doi.org/10.1201/9781003303053-13
Publikováno v:
ICTACT Journal on Soft Computing, Vol 7, Iss 4, Pp 1492-1497 (2017)
We have introduced a new operation called the superimposition operation. The translucent language generated by a given superimposition operation and a language L is the set of words generated by the superimposition of any two words in L. In this pape
Publikováno v:
IOP Conference Series: Materials Science and Engineering. 1012:012060
In this paper, we have defined Parallelisable strings and languages in order to reduce the recognition time of strings. Parallelisable languages have been introduced and their recognition has been studied through parallelisable finite automaton. We h
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9788132210405
BIC-TA (2)
BIC-TA (2)
In this paper, we define θ—bordered infinite word and unbordered words and study their properties. We give a characterization of \( \theta \)—bordered infinite words for an antimorphic involution θ. We show that the limit language of the set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9561216db47e0a59fbceee8658612bb4
https://doi.org/10.1007/978-81-322-1041-2_31
https://doi.org/10.1007/978-81-322-1041-2_31
Publikováno v:
BIC-TA
In this paper, we define $\theta$-bordered factor of a word, the concept of $\theta$-valence of a bordered factor and $\theta$-sub word complexity of a word. We study some properties of involutively $\theta$-bordered factors of a word. This study can
Autor:
V. Rajkumar Dare, N. Jansirani
Publikováno v:
BIC-TA
In this paper we introduce an infinite array with diminishing cells and study some of their combinatorial properties. We call this array as Dr array. A code space can be reorganized in an endless variety of amazing geometrical and topological ways to