In section 3, an algorithm performing so called generalized good translation of formal languages is given in the form of an ALGOL 60 procedure. Its description is given in section 2. It is possible to translate from a formal (context-free) language into other one with help of this algorithm if certain conditions hold for both grammars. At the same time, some parts of output text may correspond ...

The regulation of mRNA translation is a major checkpoint in the flux of information from the transcriptome to the proteome. Critical for translational control are the trans-acting factors, RNA-binding proteins (RBPs) and small RNAs that bind to the mRNA and modify its translatability. This review summarizes the mechanisms by which RBPs regulate mRNA translation, with special focus on those bind...

Most relational database systems provide a facility for supporting user views. Permitting this level of abstraction has the danger, however, that update requests issued by a user within the context of his view may not translate correctly into equivalent updates on the underlying database. It is the purpose of this paper to formalize the notion of correct translatability, and to derive constrain...

The constant-complement approach is one of the principal strategies for defining the reflections of database view updates. The purpose of this paper is twofold. First, a self-contained presentation of the strategy itself is given. Second, two fundamental invariance problems are examined. In admissibility invariance, the question of when the translatability of a view update is independent of the...

This paper presents the results of a case study focusing on the design and development of specific Controlled Language rules, which address readability and translatability issues generated by -ing words. This paper reviews several development and deployment iterations, whereby users’ feedback was taken into account for future development phases. We show that two complementary techniques may be ...

We investigate CPS translatability of typed al uli with indu tive and oindu tive types. We show that tenable Plotkin-style all-by-name CPS translations exist for simply typed al uli with a natural number type and stream types and, more generally, with arbitrary positive indu tive and oindu tive types. These translations also work in the presen e of ontrol operators and generalize for dependentl...