Combinatorial properties of Fibonacci partial words and arrays

Kumari, R. Krishna; Arulprakasam, R.; Dare, V. R.

doi:10.1080/09720529.2020.1794527

Journal of Discrete Mathematical Sciences and Cryptography

2021

DOI: 10.1080/09720529.2020.1794527

|View full text |Cite

Combinatorial properties of Fibonacci partial words and arrays

R. Krishna Kumari

R. Arulprakasam

V. R. Dare

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2023

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Partial words are words with holes and are considered in gene comparisons [8,14]. For instance, orientation of two DNA sequences can be seen as construction of two compatible ℘words.…”

mentioning

confidence: 99%

BLOCK INVERSION ON ${\wp}$WORDS WITH ZERO PALINDROMIC DEFECT

Krishna Kumari,

Janaki,

Arulprakasam

2023

Int. J. of Appl. Math.

View full text Add to dashboard Cite

The role of ℘words and inversions in molecular biology led to a unified study of inversions on ℘words. In this paper, we use a generalization of the concept of inversion termed as block inversion on finite rich ℘words. A comparison of block inversion on finite total words and on finite ℘words is made. We conclude that the total number of ℘words in the block inversion set of a finite rich ℘word of length n is strictly less than 2 n−1 .

show abstract

“…Partial words are words with holes and are considered in gene comparisons [8,14]. For instance, orientation of two DNA sequences can be seen as construction of two compatible ℘words.…”

mentioning

confidence: 99%

BLOCK INVERSION ON ${\wp}$WORDS WITH ZERO PALINDROMIC DEFECT

Krishna Kumari,

Janaki,

Arulprakasam

2023

Int. J. of Appl. Math.

View full text Add to dashboard Cite

show abstract

On Subclasses of Recognizable ωω−Partial Array Languages

Muhiuddin

Janaki

Al-Kadi

et al. 2022

Journal of Mathematics

Self Cite

View full text Add to dashboard Cite

In this paper, the concepts of infinite partial array languages ( ω ω − partial array languages) and the classes of ω ω − partial array languages, namely, local ω ω − partial array languages, Buchi local ω ω − partial array languages, and Muller local ω ω − partial array languages are defined, and their related properties are studied. Furthermore, we introduce nondeterministic finite online tessellation h -automata on ω ω − partial array languages. In addition, we prove that the class of all adherences of finite local partial array languages is equal to the class of all local ω ω − partial array languages and also prove that every ω ω − regular partial array language is a projection of Buchi local ω ω − partial array language.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Combinatorial properties of Fibonacci partial words and arrays

Cited by 2 publications

References 14 publications

BLOCK INVERSION ON ${\wp}$WORDS WITH ZERO PALINDROMIC DEFECT

BLOCK INVERSION ON ${\wp}$WORDS WITH ZERO PALINDROMIC DEFECT

On Subclasses of Recognizable ωω−Partial Array Languages

Contact Info

Product

Resources

About