A new approach to regular & indeterminate strings

In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A string is one that “isomorphic” to whose entries all consist single letter, but which nevertheless may itself include containing multiple letters. not said be indeterminate. We begin by proposing new model for the representation strings, or indeterminate, then go on describe linear time algorithm determine whether x=x[1..n] and, if so, replace it lexicographically least (lex-least) y are Furthermore, connect regularity transitive closure problem graph, in our special case can efficiently solved. introduce idea feasible palindrome array MP string, prove every corresponds some (regular indeterminate) string. an constructs x corresponding given MP, while ensuring whenever possible lex-least. final section outlines research directions suggested changed perspective