Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in formal language theory, coding theory, and combinatorics on words to name a few. In this paper, we extend some fundamental results about primitive words to primitive partial words. Partial words are strings that may have a number of “do not know” symbols. © 2005 Else...

In design of complex and large scale systems, formal verification has played an important role. However, it is inefficiency to verify the entire systems. This article considers the case where designers of systems can extract check-points easily in formal verification. Moreover, we propose a method by which temporal formulas can be obtained inductively for specifications in formal verification. ...

That is why the syntax of a natural language ~ not be described by the rules of the syntax of a formal language. And that is why a natural language cannot be parsed the same way as a formal language. To parse a natural language, it would be necessary to know its syntax, Thus, major difficulties in parsing a natural language are not algorithmic but linguistic. Here, I assume that natural languag...

We introduce a new complexity measure of a factorial formal language L: the growth rate of the set of minimal forbidden words. We prove some combinatorial properties of minimal forbidden words. As main result we prove that the growth rate of the set of minimal forbidden words for L is a topological invariant of the dynamical system deened by L.

let $k$ be a field of characteristic$p>0$, $k[[x]]$, the ring of formal power series over $ k$,$k((x))$, the quotient field of $ k[[x]]$, and $ k(x)$ the fieldof rational functions over $k$. we shall give somecharacterizations of an algebraic function $fin k((x))$ over $k$.let $l$ be a field of characteristic zero. the power series $finl[[x]]$ is called differentially algebraic, if it satisfies...

Words (strings of symbols) are fundamental in computer processing. Indeed, each bit of data processed by a computer is a string, and nearly all computer software use algorithms on strings. There are also abundant supply of applications of these algorithms in other areas such as data compression, DNA sequence analysis, computer graphics, cryptography, and so on. Combinatorics on words belongs to...

Parikh matrices have become a useful tool for investigation of subword structure of words. Several generalizations of this concept have been considered. Based on the concept of formal power series, we describe a general framework covering most of these generalizations. In addition, we provide a new characterization of binary amiable words – words having a common Parikh matrix. Mathematics Subje...

Previous research has demonstrated that people listen to music for various reasons. The purpose of this study was to investigate people’s perception of music, and thus their music information needs. These ideas were examined by presenting 22 participants with 7 classical musical pieces, asking one-half of them to write words descriptive of each piece, and the other half words they would use if ...

Microblogging is a popular social media where people express their opinions and sentiment on social topics. The Chinese microblogging service, called Weibo, has become a remarkable media in the Chinese society. People are eager to know others’ attitudes towards social events, thus sentiment analysis on those topical microblog messages is important. In this paper we introduce a lexicon-based sen...