Testing avoidability on sets of partial words is hard

We prove that the problem of deciding whether a finite set of partial words is unavoidable is NP-hard for any alphabet of size larger than or equal to two, which is in contrast with the well-known feasability results for unavoidability of a set of full words. We raise some related questions on avoidability of sets of partial words

Number of Holes in Unavoidable Sets of Partial Words I

Partial words are sequences over a finite alphabet that may contain some undefined positions called holes. We consider unavoidable sets of partial words of equal length. We compute the minimum number of holes in sets of size three over a binary alphabet (summed over all partial words in the sets). We also construct all sets that achieve this minimum. This is a step towards the difficult problem of fully characterizing all unavoidable sets of partial words of size three

Unavoidable Sets of Partial Words

The notion of an unavoidable set of words appears frequently in the fields of mathematics and theoretical computer science, in particular with its connection to the study of combinatorics on words. The theory of unavoidable sets has seen extensive study over the past twenty years. In this paper we extend the definition of unavoidable sets of words to unavoidable sets of partial words. Partial words, or finite sequences that may contain a number of ?do not know? symbols or ?holes,? appear naturally in several areas of current interest such as molecular biology, data communication, and DNA computing. We demonstrate the utility of the notion of unavoidability of sets of partial words by making use of it to identify several new classes of unavoidable sets of full words. Along the way we begin work on classifying the unavoidable sets of partial words of small cardinality. We pose a conjecture, and show that affirmative proof of this conjecture gives a sufficient condition for classifying all the unavoidable sets of partial words of size two. We give a result which makes the conjecture easy to verify for a significant number of cases. We characterize many forms of unavoidable sets of partial words of size three over a binary alphabet, and completely characterize such sets over a ternary alphabet. Finally, we extend our results to unavoidable sets of partial words of size k over a k-letter alphabet

Some Varieties of Superparadox. The implications of dynamic contradiction, the characteristic form of breakdown of breakdown of sense to which self-reference is prone

The Problem of the Paradoxes came to the fore in philosophy and mathematics with the discovery of Russell's Paradox in 1901. It is the "forgotten" intellectual-scientific problem of the Twentieth Century, because for more than sixty years a pretence was maintained, by a consensus of logicians, that the problem had been "solved"

Legal Language and The Legal Translator

It is impossible to set up standards of translation performance and equivalence which will apply to any legal translation because the "languages of law" are as varied as the cases that reach the courts every day. Moreover, the translation of legal texts is often complicated by the lack of exact lexical equivalents in the TL's own legal system so that a transfer involves a high amount of "creative production". Obviously this production should be based on a profound extra-linguistic knowledge of both legal systems involved to avoid the pitfalls which the difference in conceptual meaning necessarily entails. Thus research into the TL's substantive law must be the first requirement in any legal translation context

Cultural Memory Conflicted in Post-Conflict Peru: Constructing Heroes and Villains La hora final and La casa rosada

Building on this same theoretical platform, this project uses two critically-acclaimed contemporary cinematic representations of the internal armed conflict—La hora final and La casa rosada—as reflections of the ways in which the Peruvian cultural products of today are leveraged to reorchestrate collective understandings of the past

Lost in Translation: International Criminal Tribunals and the Legal Implications of Interpreted Testimony

When courtroom interpreters translate a witness\u27s testimony, errors are not just possible, they are inherent to the process. Moreover, the occurrence of such errors is not merely a technical problem; errors can infringe on the rights of defendants or even lead to verdicts based on faulty findings of fact. International criminal proceedings, which are necessarily multilinguistic, are both particularly susceptible to interpretation errors and sensitive to questions of procedural fairness. This Article surveys the history and mechanics of courtroom interpretation, explains the inherent indeterminacy of translated language, and describes the other sources of inaccuracy in interpreted testimony. It then assesses the impact that errors in interpretation may have on fact finding by international criminal tribunals and on the rights of international criminal defendants. The Article concludes by suggesting some low-cost and easy-to-institute measures that will reduce the likelihood that a judgment will turn on an inaccurate interpretation. Improving the quality of translation will buttress the rightness of the international criminal tribunals\u27 judgments and the fairness of their procedures