SearcharxivSearch

arXiv subjects

Kalpana Mahalingam

Publications and source records attributed to Kalpana Mahalingam.

10 recordsLinked to original sources

On words that nearly $θ$-commute

The Hamming distance between two equal length words $α, β$ is the number of positions where $α$ and $β$ differ. For $x, y \in Σ^*$ and antimorphic involution $θ$, $x$ $θ$-commutes with $y$, if the Hamming distance between $xy$ and $θ(y)x$ is zero. When the Hamming distance between $xy$ and $θ(y)x$ attains its minimum non-zero value of one, then we say $x$ nearly $θ$-commutes with $y$. This manuscript investigates properties of $x$ and $y$ such that the Hamming distance between $xy$ and $θ(y)x$ is one. We provide a complete characterization of such $x$ and $y$. We introduce a binary relation $R_θ$ on $Σ^*$, where $x R_θy$ holds if and only if $x$ nearly $θ$-commutes with $y$. Finally, for a given $y$, we collect all $x$ such that $x$ nearly $θ$-commutes with $y$, and discuss various properties of this set.

math.CO

Watson-Crick strong bi-catenation on words

In this paper we define and investigate the binary word operation of strong-$ϕ$-bi-catenation (denoted by $\leftrightarrows_ϕ$) where $ϕ$ is either a morphic or an antimorphic involution. In particular, we concentrate on the mapping $ϕ=θ_{DNA}$, which models the Watson-Crick complementarity of DNA single strands. We show that such an operation is commutative and not associative and when iteratively applied to a word $u$, this operation generates words over $\{u, θ(u)\}$. We then extend this operation to languages and show that the families of regular, context-free and context-sensitive languages are closed under the operation of strong-$ϕ$-bi-catenation. We also define the notion of $\leftrightarrows_θ$-conjugacy and study conditions on words $u$ and $v$ where $u$ is a $\leftrightarrows_θ$-conjugate of $v$. We then extend this relation to language equations and provide solutions under some special cases.

math.CO

Watson-Crick conjugates of words and languages

In this work, we explore the concept of Watson-Crick conjugates, also known as $θ$-conjugates (where $θ$ is an antimorphic involution), of words and languages. This concept extends the classical idea of conjugates by incorporating the Watson-Crick complementarity of DNA sequences. Our investigation initially focuses on the properties of $θ$-conjugates of words. We then define $θ$-conjugates of a language and study closure properties of certain families of languages under the $θ$-conjugate operation. Furthermore, we analyze the iterated $θ$-conjugate of both words and languages. Finally, we discuss the idea of $θ$-conjugate-free languages and examine some decidability problems related to it.

cs.FL

Rich Words in the Block Reversal of a Word

The block reversal of a word $w$, denoted by $\mathtt{BR}(w)$, is a generalization of the concept of the reversal of a word, obtained by concatenating the blocks of the word in the reverse order. We characterize non-binary and binary words whose block reversal contains only rich words. We prove that for a binary word $w$, richness of all elements of $\mathtt{BR}(w)$ depends on $l(w)$, the length of the run sequence of $w$. We show that if all elements of $\mathtt{BR}(w)$ are rich, then $2\leq l(w)\leq 8$. We also provide the structure of such words.

math.CO

Counting scattered palindromes in a finite word

We investigate the scattered palindromic subwords in a finite word. We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an upper bound for the total number of palindromic subwords in a word of length $n$ in terms of Fibonacci number $F_n$ by proving that at most $F_n$ new scattered palindromic subwords can be created on the concatenation of a letter to a word of length $n-1$. We propose a conjecture on the maximum number of scattered palindromic subwords in a word of length $n$ with $q$ distinct letters. We support the conjecture by showing its validity for words where $q\geq \frac{n}{2}$.

cs.DM

Generalized Linear One-Way Jumping Finite Automata

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 in one direction. A generalized linear one-way jumping finite automaton makes jumps after deleting a substring of an input string and then changes its state. These automata can make sequence of jumps in only one direction on an input string either from left to right or from right to left. We show that newly defined model is powerful than its original counterpart. We define and compare the variants, generalized right linear one-way jumping finite automata and generalized left linear one-way jumping finite automata. We also compare the newly defined models with Chomsky hierarchy. Finally, we explore closure properties of the model.

cs.FL

Generalized Circular One-Way Jumping Finite Automata

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 deleting a letter of an input and jump only in one direction. Allowing a state to delete a subword instead of a letter, we define a new model generalized circular one-way jumping finite automata. These automata work on an input in a circular manner. Similar to one-way jumping finite automata, generalized circular one-way jumping finite automata also jump only in one direction. We show that this newly defined model is powerful than one-way jumping finite automata. We define new variants(right and left) of the model generalized circular one-way jumping finite automata and compare them. We also compare the newly defined model with Chomsky hierarchy. Finally, we explore closure properties of the model.

cs.FL

Theta palindromes in theta conjugates

A DNA string is a Watson-Crick (WK) palindrome when the complement of its reverse is equal to itself. The Watson-Crick mapping $θ$ is an involution that is also an antimorphism. $θ$-conjugates of a word is a generalisation of conjugates of a word that incorporates the notion of WK-involution $θ$. In this paper, we study the distribution of palindromes and Watson-Crick palindromes, also known as $θ$-palindromes among both the set of conjugates and $θ$-conjugates of a word $w$. We also consider some general properties of the set $C_θ(w)$, i.e., the set of $θ$-conjugates of a word $w$, and characterize words $w$ such that $|C_θ(w)|=|w|+1$, i.e., with the maximum number of elements in $C_θ(w)$. We also find the structure of words that have at least one (WK)-palindrome in $C_θ(w)$.

cs.FL

Palindromes in two-dimensional Words

A two-dimensional ($2$D) word is a $2$D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are $1$D palindromes. We study some combinatorial and structural properties of HV-palindromes and its comparison with $2$D palindromes. We investigate the maximum number number of distinct non-empty HV-palindromic sub-arrays in any finite $2$D word, thus, proving the conjecture given by Anisiua et al. We also find the least number of HV-palindromes in an infinite $2$D word over a finite alphabet size $q$.

cs.DM

Label Languages of 8-directional Array P System

An 8-directional array P system is one where the rewriting of an array can happen in any 8-directions. The array rules of such a system are labelled thus resulting in a labelled 8-directional array P system. The labelling is not unique and the label language is obtained by recording the strings over the labels used in any terminating derivation of the P system. The system is shown to generate interesting pictures. The label language is compared with Chomsky hierarchy.

cs.FL