Let $L$ be a finite Orthomodular Lattice and $T$ the Formal Context of $L$. Then, considering as binary symmetric matrix, we find determinant formal context atomic amalgam $B_n+B_m$ two Boolean algebras $\mathbf{B_{n}}$ $\mathbf{B_{m}}$ consisting $n$ $m$ atoms, respectively using Schur complement formula\cite{p28}. We present proofs some preliminary results on table algebra $B_{n}$ characteris...

To clarify what is involved in linking models to instruments, we adapt quantum mechanics to define models that display explicitly the points at which they can be linked to statistics of results of the use of instruments. Extending an earlier proof that linking models to instruments takes guesswork, we show: Any model of cryptographic instruments can be enveloped, nonuniquely, by another model t...

This paper describes a wide-range restructuring of intermediate representations in machine translation, which is necessary for bridging stylistic gaps between source and target languages and for generating natural target sentences. We propose a practical way of designing machine translation systems, based on the transfer method, that deal with wide-range restructuring. The transfer component sh...

A filtration of a formal language L by a sequence s maps L to the set of words formed by taking the letters of words of L indexed only by s. We consider the languages resulting from filtering by all arithmetic progressions. If L is regular, then we prove that only finitely many distinct languages result. By contrast, there exist CFL’s that give infinitely many distinct languages as a result. We...

We present a novel approach for generating effective referring expressions (REs). We define a synchronous grammar formalism that relates surface strings with the sets of objects they describe through an abstract syntactic structure. The grammars may choose to require or not that REs are distinguishing. We then show how to compute a chart that represents, in finite space, the complete (possibly ...

The use of bioinformatics’ tools for the study of non-coding RNA still remains a difficult task since RNA’s primary structure (the sequence itself) is not as informative as that of coding RNA and for this reason, research must rely on the study of secondary structure. One of the most promising tools in the field is the use of formal grammars. In this article a critical review of different metho...

We investigate various language famili$:s which can be obtained from sentential form languages of semi-Thue systems by applying codmgs, weak codings, non-erasing homomorphisms, and arbitrary homomorphi5rns. We also distinguish between monotone, contexi-independent, and context-dependent semi-Thur systems with at most one or finitely many starting words. Finally, we study the effect of erasing p...

Pattern languages are generalisations of the copy language, which is a standard textbook example of a context-sensitive and noncontext-free language. In this work, we investigate a counter-intuitive phenomenon: with respect to alphabets of size 2 and 3, pattern languages can be regular or context-free in an unexpected way. For this regularity and context-freeness of pattern languages, we give s...

Current approaches for the discovery, specification, and provision of services ignore the relationship between the service contract and the conditions in which the service can guarantee its contract. Moreover, they do not use formal methods for specifying services, contracts, and compositions. Without a formal basis it is not possible to justify through formal verification the correctness condi...