Search results for "Prefix"
showing 10 items of 57 documents
Grammaticalization of actional values in Archaic Latin
2008
This paper aims at showing how prefixation does not modify systematically the actional value of Latin verbs. Scholars of historical grammars of Indoeuropean languages and traditional studies about prefixation agree with the idea that in Latin, and in all Indoeuropean languages, preverbation results on actional value of predicates: Delbruck 1897 argued that prefixes perfectivize verbal meaning since they indicate its accomplishment; Meillet and Vendryes 1924 claimed that the prefixe focuses a specific point of the process described by the non prefixed verb; van der Heide 1934 believed that Latin preverbs express the accomplishment of the process denotated by the non prefixed verbs. More rece…
From Nerode's congruence to Suffix Automata with mismatches
2009
AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…
Ortotipografía científica en publicaciones médico-quirúrgicas: la normativa académica relativa a la prefijación
2015
El objetivo del presente artículo es analizar el grado de cumplimiento de la normativa académica relativa a la correcta escritura de las palabras prefijadas (recogida en la nueva Ortografía de 2010) que realizan algunas publicaciones periódicas de carácter científico-técnico y, en concreto, del ámbito médico-quirúrgico. Se trata de una labor de profundización en un estudio anterior (Aguilar Ruiz 2012: 9-12). Para ello, comentamos los errores e incorrecciones más recurrentes de un corpus de publicaciones científicas argentinas de finales de 2012. The aim of this paper is to analyze the degree of compliance on the correct academic writing prefixed words (contained in the new spelling) that pe…
A 16QAM super-orthogonal space-frequency code for broadband mobile communication systems with two transmit antennas
2010
We combine our previously designed 32-state super-orthogonal space-time trellis code (SOSTTC) with orthogonal frequency division multiplexing (OFDM) to build a broadband mobile communication system having a spectral efficiency that amounts to 4 bits/s/Hz depending on the length of the cyclic prefix used to avoid interframe interference. The transmitter is equipped with two antennas, where the OFDM frames they transmit are not independent, as they carry the same information in an orthogonal form. The 2N OFDM tones are grouped in N pairs of tones. Each group of two tones transmits the entries of a 2×2 orthogonal matrix. In our case, the entries are symbols taken from the rectangular 16-point …
Valoda: nozīme un forma 8. Valodas gramatiskās un leksiskās sistēmas variatīvums
2017
Valsts pētījumu programmas „Letonika – Latvijas vēsture, valodas, kultūra, vērtības” projekta Nr. 3 „Latviešu valodas pētījumi 21. gadsimta zinātnes kontekstā” apakšprojekts „Latviešu valodas gramatika / Latvian Grammar”
Diagonal space time hadamard codes with erasure decoding algorithm
2005
A major challenge in the area of space time (ST) codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing ST code designs which require maximum-likelihood (ML) decoding. A solution could be to apply single-input single-output (SISO) channel codes and theory over temporal channel fading to the multi-input single-output (MISO) code construction and classical suboptimum decoding methods. For these purposes, an ST code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal ST Hadamard (D-STH) code with Paley constructions and the outer code is an algebraic b…
Recent results on syntactic groups of prefix codes
2012
International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.
Transducers for the bidirectional decoding of prefix codes
2010
AbstractWe construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod (1999) in [5] and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding.We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of Girod’s encoding method. We prove that it has the same properties as those of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.
Coding Sequences with Constraints
1990
In this paper we consider the following problem: given all bi-infinite sequences of symbols satisfying certain constraints, search for a set X of words such that i): any concatenation of elements of X satisfies these constraints and ii): any sequence verifying the constraints can be “parsed” in elements of X.
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
Girod’s encoding method has been introduced in order to efficiently decode from both directions messages encoded by using finite prefix codes. In the present paper, we generalize this method to finite codes with a finite deciphering delay. In particular, we show that our decoding algorithm can be realized by a deterministic finite transducer. We also investigate some properties of the underlying unlabeled graph.