From Display to Labelled Proofs for Tense Logics

We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt

Macro tree transducers

Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation classes. The extension with regular look-ahead is considered

Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies

Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space and time polynomial in the length of the input strings, but with the degree of the polynomial depending on the permutations of the SCFG rules. We consider linear parsing strategies, which add one nonterminal at a time. We show that for a given input permutation, the problems of finding the linear parsing strategy with the minimum space and time complexity are both NP-hard

Jamming transition in a driven lattice gas

We study a two-lane driven lattice gas model with oppositely directed particles moving on two periodic lanes with correlated lane switching processes, so that particles can switch lanes with finite probability only when oppositely directed particles meet on the same lane. This system exhibits an unique behavior, wherein a phase transition is observed between a homogeneous absorbing phase, characterized by complete segregation of oppositely directed particles between the two lanes, and a jammed phase where each species of particles occupy both the lanes, along with formation of large cluster. This transition is accompanied by a finite drop of current in the lattice, emergence of cluster comprising of both species of particles, and is determined by the interplay of the relative rates of translation of particles on the same lane and their lane switching rates. These findings may have interesting implications for understanding the phenomenon of jamming in microtubule filaments observed in context of axonal transport.Comment: 6 pages, 7 fi

The copying power of one-state tree transducers

One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle "prime copying," i.e., their class of output (string) languages is not closed under the operation L → {$(w$)f(n) w ε L, f(n) ≥ 1}, where f is any integer function whose range contains numbers with arbitrarily large prime factors (such as a polynomial). The exact amount of nonclosure under these copying operations is established for several classes of input (tree) languages. These results are relevant to the extended definable (or, restricted parallel level) languages, to the syntax-directed translation of context-free languages, and to the tree transducer hierarchy.\ud \u

Translations on a context free grammar

Two schemes for the specification of translations on a context-free grammar are proposed. The first scheme, called a generalized syntax directed translation (GSDT), consists of a context free grammar with a set of semantic rules associated with each production of the grammar. In a GSDT an input word is parsed according to the underlying context free grammar, and at each node of the tree, a finite number of translation strings are computed in terms of the translation strings defined at the descendants of that node. The functional relationship between the length of input and length of output for translations defined by GSDT's is investigated.The second method for the specification of translations is in terms of tree automata—finite automata with output, walking on derivation trees of a context free grammar. It is shown that tree automata provide an exact characterization for those GSDT's with a linear relationship between input and output length

Making the Standard of Audiovisual Text for the Deaf and Hearing Impaired

The development of television and film industry in a global context requires film and television industry to be able to present the shows that can be enjoyed by the general public without any restrictions. This phenomenon essentially underlies the emergence of community needs for audiovisual translation (layman terms: the subtitle). The industrialized world utilize audioviual translation in order to visualize verbal messages in other languages so that it can be understood. However, any progress in the field of audiovisual is not coupled with accessibility for all individuals. Providers of text or audio in existing programs, so far, have not fully considered deaf people or those with hearing impaired (deaf or hearing impaired/DH). In line with that, a set of standard is required to meet the needs of the DH. Referring to the high demand for audiovisual translation and the view on the audiovisual translation which has not yet met the needs of the DH, This research is fundamentally directed to create audiovisual translation standards which is appropriate for all audiences specifically for the DH. This study is a qualitative study using library research approach. Therefore, the analysis is directed at the analysis of the current product and its shortcomings. To be able to meet the demand for audiovisual translation standards, researchers will undertake a number of steps that includes product analysis research and product development. This study is expected to be the basis for making an audiovisual translation quality products which can be enjoyed by all audiences.Keywords: Audiovisual translation, deaf or hearing impaired, research and development

Memory, Communism, and foreign words in Julia Holewińska’s Foreign Bodies: balancing foreignization and domesticating strategies in a production by Polish Theatre Ireland

This article engages with selected translation strategies undertaken to transfer a Polish play by Julia Holewińska, ‘Ciała Obce’ [Foreign Bodies], into the context of Irish theatre. I look at Polish Theatre Ireland’s production of the play (directed by Lianne O’Shea and presented in Dublin’s Project Arts Centre in 2013), focusing on linguistic and cultural aspects of the translation and, in particular, issues concerning the memories of communism in Poland. The analysis is framed by Lawrence Venuti’s theorisation of translation processes and explores the negotiations and tensions between ‘foreignisation’ and ‘domestication’ in the translating, staging, and presenting of ‘Foreign Bodies’ in Ireland. I propose that by using both strategies to transfer memories of communism in Poland to the Irish stage, the production can facilitate an intercultural discussion on gender in the Polish and Irish contexts and allow multicultural audiences different levels of engagement

Type-Directed Weaving of Aspects for Higher-order Functional Languages

Aspect-oriented programming (AOP) has been shown to be a useful model for software development. Special care must be taken when we try to adapt AOP to strongly typed functional languages which come with features like a type inference mechanism, polymorphic types, higher-order functions and type-scoped pointcuts. Our main contribution lies in a seamless integration of these two paradigms through a static weaving process which deals with around advices with type-scoped pointcuts in the presence of higher-order functions. We give a source-level type inference system for a higher-order, polymorphic language coupled with type-scoped pointcuts. The type system ensures that base programs are oblivious to the type of around advices. We present a type-directed translation scheme which resolves all advice applications at static time. The translation removes advice declarations from source programs and produces translated code which is typable in the Hindley-Milner system