Search results for "Computational Linguistics"
showing 10 items of 210 documents
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
1996
The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with re…
On P-compatible hybrid identities and hyperidentities
1994
P-compatible identities are built up from terms with a special structure. We investigate a variety defined by a set ofP-compatible hybrid identities and answer the question whether a variety defined by a set ofP-compatible hyperidentities can be solid.
A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
2013
Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…
Polarization Modulation Instability in All-Normal Dispersion Microstructured Optical Fibers with Quasi-Continuous 1064 nm Pump
2019
Polarization modulation instability (PMI) is a form of modulation instability that can exist in weakly birefringent optical fibers [1]. Sidebands can be generated by this effect when a polarization mode of the birefringent fiber is excited with an intense optical pump. The polarization state of the sidebands is orthogonal to the polarization of the pump signal. PMI has been observed in microstructured optical fibers (MOFs). PMI was reported in a large-air-filling fraction MOF that was pumped in the normal dispersion regime with visible light [2]. The coherent degradation of femtosecond supercontinuum light generated in all-normal dispersion (ANDi) MOFs due to PMI was recently investigated […
Form factors of the isovector scalar current and the ηπ scattering phase shifts
2015
33 pages.- 14 figures.- v2: Some clarifications and corrections of typos
Puentes entre la Lingüística computacional y la Psicolingüística
2011
[EN] Cognitive sciences have assumed that there can be relationships between various disciplines such as Philosophy, Linguistics, Anthropology, Artificial Intelligence, or Psychology. This work aims to make explicit these relations between the Psycholinguistics and Computational Linguistics.
Blow-up collocation solutions of nonlinear homogeneous Volterra integral equations
2011
In this paper, collocation methods are used for detecting blow-up solutions of nonlinear homogeneous Volterra-Hammerstein integral equations. To do this, we introduce the concept of "blow-up collocation solution" and analyze numerically some blow-up time estimates using collocation methods in particular examples where previous results about existence and uniqueness can be applied. Finally, we discuss the relationships between necessary conditions for blow-up of collocation solutions and exact solutions.
Languages with mismatches
2007
AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…
Balance Properties and Distribution of Squares in Circular Words
2008
We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalised to non periodic infinite words as well.
Periodic Orbits in the Isosceles Three-Body Problem
1991
The Saturn’s satellites Janus and Epimetheus are the first known bodies in the Solar System that has horseshoe orbits in a frame that rotates with uniform angular velocity. Both satellites have similar masses and orbital elements when they are far from one another. Moreover, their orbits are nearly symmetric. In fact, in the past, they have been identify as a unique satellite and afterwards, some mathematical theories about their orbits has been necessaries to understand why they do not collide. In particular, the interest in planar three-body problem with two small masses has increased6. We assume that the two small masses have similar symmetric initial conditions. The aim of this paper is…