In this paper, we study a subclass of constraint automata with local variables. The fragment denotes an executable subset for which synchronization and data constraints are expressed in imperative guarded command style, instead denotational style as the coordination language Reo. To demonstrate executability property, provide translation scheme from symbolic to Promela, model checker Spin. As p...

The translation of political speeches is crucial in today's globalized world, where leaders communicate with audiences different languages and cultures. Reproducing expressive devices particularly important as it significantly affects the understanding interpretation message. This study aims to identify peculiarities reproducing means translation, including metaphors, allegories, antitheses, ot...

The main purpose of translating Tang poems is to exchange ideas and culture. On the basis of the theory of adaptablity in culturral context and translation criticism, the thesis discusses how to make the target language adapt to the cultural context of the source language during the process of the translation of Tang poems. Specifically, the target language should adapt the source language, the...

In this paper, the possibility of verifying π-calculus processes via Promela translation is investigated. A general translation method from π-calculus processes to Promela models is presented and its usefulness is shown by performing verification tasks with translated π-calculus examples and SPIN. Model checking translated π-calculus processes in SPIN is shown to overcome shortcomings of the Mo...

While CYK+ and Earley-style variants are popular algorithms for decoding unbinarized SCFGs, in particular for syntaxbased Statistical Machine Translation, the algorithms rely on a so-called dot chart which suffers from a high memory consumption. We propose a recursive variant of the CYK+ algorithm that eliminates the dot chart, without incurring an increase in time complexity for SCFG decoding....

This paper gives a reduction-preserving translation from Coquand’s dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types and relations and the axiom K [22]. This translation serves as a proof of termination for structurally recursive pattern matching programs, provides an implementable compilation technique in the style of functional programming lang...

Wedescribe the implementation ofMTServer Land, an open-source architecture formachine translation that is developed by the MT group at DFKI. A broker server collects and distributes translation requests to severalworker servers that create the actual translations. Users can access the system via a fast and easy-to-use web interface or use an XML-RPC-based API interface to integrate it into thei...