Search results for "Language and speech"
showing 10 items of 166 documents
Words with the Maximum Number of Abelian Squares
2015
An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain \(\varTheta (n^2)\) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.
On the class of languages recognizable by 1-way quantum finite automata
2000
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
Bottom-quark mass from finite energy QCD sum rules
2011
Finite energy QCD sum rules involving both inverse and positive moment integration kernels are employed to determine the bottom quark mass. The result obtained in the $\bar{\text {MS}}$ scheme at a reference scale of $10\, {GeV}$ is $\bar{m}_b(10\,\text{GeV})= 3623(9)\,\text{MeV}$. This value translates into a scale invariant mass $\bar{m}_b(\bar{m}_b) = 4171 (9)\, {MeV}$. This result has the lowest total uncertainty of any method, and is less sensitive to a number of systematic uncertainties that affect other QCD sum rule determinations.
Determination of m¯b/m¯c and m¯b from nf=4 lattice QCD+QED
2021
We extend HPQCD's earlier ${n}_{f}=2+1+1$ lattice-QCD analysis of the ratio of $\overline{\mathrm{MS}}$ masses of the $b$ and $c$ quark to include results from finer lattices (down to 0.03 fm) and a new calculation of QED contributions to the mass ratio. We find that ${\overline{m}}_{b}(\ensuremath{\mu})/{\overline{m}}_{c}(\ensuremath{\mu})=4.586(12)$ at renormalization scale $\ensuremath{\mu}=3\text{ }\text{ }\mathrm{GeV}$. This result is nonperturbative. Combining it with HPQCD's recent lattice $\mathrm{QCD}+\mathrm{QED}$ determination of ${\overline{m}}_{c}(3\text{ }\text{ }\mathrm{GeV})$ gives a new value for the $b$-quark mass: ${\overline{m}}_{b}(3\text{ }\text{ }\mathrm{GeV})=4.513(2…
Words and Patterns
2002
In this paper some new ideas, problems and results on patterns are proposed. In particular, motivated by questions concerning avoidability, we first study the set of binary patterns that can occur in one infinite binary word, comparing it with the set of factors of the word. This suggests a classification of infinite words in terms of the "difference" between the set of its patterns and the set of its factors. The fact that each factor in an infinite word can give rise to several distinct patterns leads to study the set of patterns of a single finite word. This set, endowed with a natural order relation, defines a poset: we investigate the relationships between the structure of such a poset…
Usage of HMM-Based Speech Recognition Methods for Automated Determination of a Similarity Level Between Languages
2019
The problem of automated determination of language similarity (or even defining of a distance on the space of languages) could be solved in different ways – working with phonetic transcriptions, with speech recordings or both of them. For the recordings, we propose and test a HMM-based one: in the first part of our article we successfully try language detection, afterwards we are trying to calculate distances between HMM-based models, using different metrics and divergences. The Kullback-Leibler divergence is the only one we got good results with – it means that the calculated distances between languages correspond to analytical understanding of similarity between them. Even if it does not …
Special factors and the combinatorics of suffix and factor automata
2011
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages LSA and LFA of words having respectively suffix automaton and factor automaton with the minimal possible number of states.
The Shuffle Product: New Research Directions
2015
In this paper we survey some recent researches concerning the shuffle operation that arise both in Formal Languages and in Combinatorics on Words.
On the empirical spectral distribution for certain models related to sample covariance matrices with different correlations
2021
Given [Formula: see text], we study two classes of large random matrices of the form [Formula: see text] where for every [Formula: see text], [Formula: see text] are iid copies of a random variable [Formula: see text], [Formula: see text], [Formula: see text] are two (not necessarily independent) sets of independent random vectors having different covariance matrices and generating well concentrated bilinear forms. We consider two main asymptotic regimes as [Formula: see text]: a standard one, where [Formula: see text], and a slightly modified one, where [Formula: see text] and [Formula: see text] while [Formula: see text] for some [Formula: see text]. Assuming that vectors [Formula: see t…
Lévy–Khintchine decompositions for generating functionals on algebras associated to universal compact quantum groups
2018
We study the first and second cohomology groups of the $^*$-algebras of the universal unitary and orthogonal quantum groups $U_F^+$ and $O_F^+$. This provides valuable information for constructing and classifying L\'evy processes on these quantum groups, as pointed out by Sch\"urmann. In the case when all eigenvalues of $F^*F$ are distinct, we show that these $^*$-algebras have the properties (GC), (NC), and (LK) introduced by Sch\"urmann and studied recently by Franz, Gerhold and Thom. In the degenerate case $F=I_d$, we show that they do not have any of these properties. We also compute the second cohomology group of $U_d^+$ with trivial coefficients -- $H^2(U_d^+,{}_\epsilon\Bbb{C}_\epsil…