The classical continued fraction is generalized for studying the rational approximation problem on multi-formal Laurent series in this paper, the construction is called m-continued fraction. It is proved that the approximants of an m-continued fraction converge to a multiformal Laurent series, and are best rational approximations to it; conversely for any multi-formal Laurent series an algorith...

This article aims at juxtaposing King Solomon’s letter to Queen Sheba with contemporary way of composing formal letters. was a harbinger the relation that later exist between him and Sheba, Bilqis. By clearer ray discerning from Qur’anic literature, demonstrate insights intuitions in letters, just as it reveals literary superiority proof continuity letters means correspondence antiquity date. T...

Following a theoretical analysis of the scope Nash implementation for given mechanism, we study formal framework computational identification implementability. We provide tools in finite environments. In particular, supply Python codes that identify (i) domain preferences allows by (ii) maximal mechanism implements Pareto efficiency, (iii) all consistent collections sets social choice correspon...

The generalized one-sided concept lattices represent a generalization of the classical FCA method convenient for hierarchical analysis object-attribute models with different types attributes. mentioned are formalized within theory as formal contexts certain type. aim this paper is to investigate some intercontextual relationships represented by notion bond. A composition bonds defined in order ...

We propose a generic notion of consistency in an abstract labelling setting, based on two relations: one intolerance between the labelled elements and incompatibility labels assigned to them, thus allowing spectrum requirements depending actual choice these relations. As first application formal argumentation, we show that traditional Dung’s semantics can be put correspondence with different th...

This paper presents a formal symbolic trajectory evaluation theory based on a structural netlist circuit model, instead of an abstract next state function. We introduce an inductive definition for netlists, which gives an accurate and formal definition for netlist structures. A closure state function of netlists is formally introduced in terms of the formal netlist model. We refine the definiti...

MOTIVATION In a previous paper, we presented a polynomial time dynamic programming algorithm for predicting optimal RNA secondary structure including pseudoknots. However, a formal grammatical representation for RNA secondary structure with pseudoknots was still lacking. RESULTS Here we show a one-to-one correspondence between that algorithm and a formal transformational grammar. This grammar...

We provide a formal model of a stratificational dependency approach to natural language description. This formal model is motivated by an elementary method of analysis by reduction, which serves for describing correct sentence analysis. The model is based on enhanced restarting automata that assign a set of parallel dependency structures to every reduction of an input sentence. These structures...

It is worthwhile mentioning that the area of formal specifications, particularly as refers to object orientation, has not been widely developed, due to its proposal being recent and novel, mixing the traditional benefits of formal specification languages (consistency, completion and lack of ambiguity in the software developed) with object-oriented characteristics such as encapsulation, inherita...