Search results for " Languages"

Finite Automata with Advice Tapes

2013

We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, and establish the relationships between this model and the previously studied ways of providing advice to finite automata.

Minimal forbidden words and factor automata

1998

International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.

Query automata

1999

A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map a tree to a set of its nodes, play an important role in the context of structured document databases. We want to understand how the natural and well-studied computation model of tree automata can be used to compute such queries. We define a query automaton (QA) as a deterministic two-way finite automaton over trees that has the ability to select nodes depending on the state and the label at those nodes. We study QAs over ranked as well as over unranked trees. Unranked trees differ from ranked ones in that there is no bound on the num…

Negative results in the theory of games with lexicographic utilities

2003

When players may have lexicographic utilities, there are: (i) extensive games having a non-empty set of equilibria but empty sets of sequentially rational, sequential and perfect equilibria (ii) normal form games having a non-empty set of equilibria but an empty set of proper equilibria and no stable set of equilibria and (iii) two extensive games having the same normal form representation and disjoint sets of sequential equilibria.

Some decisional problems on rational relations

1997

Abstract In this paper we prove that the problem of deciding whether a deterministic rational relation is star-free is recursively solvable, although the same problem for any rational relation is undecidable. We also prove that a rational relation is star-free if and only if it is aperiodic and deterministic.

The development of “junk”. Irregularization strategies of have and say in the Germanic languages

2001

Although it is a wellknown fact that the most frequent verbs are the most irregular ones (if not suppletive), it is rarely asked how they became irregular. This article deals with the irregularization process of two originally regular (weak) verbs, HAVE and SAY in the Germanic languages, e.g. have, but has/’s and had/’d (instead of regular *haves/*haved) or say [sei], but says [sez] and said [sed] in English. Other verbs, such as DO, GO, STAND, BE, COME, and so on, also tend to irregularizations again and again without any apparent reason. In contrast to HAVE and SAY these verbs have always been rather irregular, at least dating from their first written records.

Clarkson-McCarthy inequalities with unitary and isometry orbits

2020

Abstract A refinement of a trace inequality of McCarthy establishing the uniform convexity of the Schatten p-classes for p > 2 is proved: if A , B are two n-by-n matrices, then there exists some pair of n-by-n unitary matrices U , V such that U | A + B 2 | p U ⁎ + V | A − B 2 | p V ⁎ ≤ | A | p + | B | p 2 . A similar statement holds for compact Hilbert space operators. Another improvement of McCarthy's inequality is given via the new operator parallelogramm law, | A + B | 2 ⊕ | A − B | 2 = U 0 ( | A | 2 + | B | 2 ) U 0 ⁎ + V 0 ( | A | 2 + | B | 2 ) V 0 ⁎ for some pair of 2n-by-n isometry matrices U 0 , V 0 .

Translation as Experimentation within the Context of Migration

2008

La didáctica de lenguas extranjeras en los estudios de Traducción e Interpretación. ¿Qué nos dice la investigación?

2020

[EN] The knowledge of both foreign and mother languages constitutes a core competence in translator and interpreter training, as professional translation cannot exist if this competence has not been previously consolidated. Nevertheless, research regarding the teaching and acquisition of foreign languages within Translation and Interpreting studies is extremely scarce and its practice frequently adheres to general pedagogical models which do not keep to the ultimate goal and main objectives that should lay down the foreground for this type of teaching. On this basis, this article aims to discuss the main literature derived from this field of expertise and offer a reflection on the teaching …

Recensione di A. Rizzo: "Oltre l'Occidente. Traduzione e alterità culturale

2009

This piece is a review of Bosinelli and Di Giovanni's anthology, which is enriched by an interesting introduction by the editors of the volume and a very significant conclusion by an expert in translation studies: Siri Neergard. The collection, which is characterised by articles translated into Italian for the first time, deals with themes such as translation and migration, postcolonialism, cultural translation.