相关论文: Introducing Privileged Words: Privileged Complexit…

We study infinite string modules that are bricks over some gentle algebras. In particular, we first give a complete classification of these modules over the double-Kronecker gentle algebra and prove that each family is in bijection with a…

In this paper we study an abelian version of the notion of return word. Our main result is a new characterization of Sturmian words via abelian returns. Namely, we prove that a word is Sturmian if and only if each of its factors has two or…

In this paper, we provide a new characterization of uniformly recurrent words with finite defect based on a relation between the palindromic and factor complexity. Furthermore, we introduce a class of morphisms P_ret closed under…

We follow the works of Puzynina and Zamboni, and Rigo et al. on abelian returns in Sturmian words. We determine the cardinality of the set $\mathcal{APR}_u$ of abelian returns of all prefixes of a Sturmian word $u$ in terms of the…

We propose a new word embedding model, called SPhrase, that incorporates supervised phrase information. Our method modifies traditional word embeddings by ensuring that all target words in a phrase have exactly the same context. We…

Regular episturmian words are episturmian words whose directive words have a regular and restricted form making them behave more like Sturmian words than general episturmian words. We present a method to evaluate the initial nonrepetitive…

In this paper we discuss the following issue: How do we decide whether a certain property of language is a competence property or a performance property? Our claim is that the answer to this question is not given a-priori. The answer…

The study of complexity and optimization in decision theory involves both partial and complete characterizations of preferences over decision spaces in terms of real-valued monotones. With this motivation, and following the recent…

Starting from a study of Y. Bugeaud and A. Dubickas (2005) on a question in distribution of real numbers modulo 1 via combinatorics on words, we survey some combinatorial properties of (epi)Sturmian sequences and distribution modulo 1 in…

We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated…

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has…

In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…

A pseudo-primitive word with respect to an antimorphic involution \theta is a word which cannot be written as a catenation of occurrences of a strictly shorter word t and \theta(t). Properties of pseudo-primitive words are investigated in…

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…

We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form $\alpha\beta\gamma$, where $\alpha,\beta,\gamma$ is any permutation of the symbols…

We introduce a topological approach to words. Words are approximated by Gauss words and then studied up to natural modifications inspired by homotopy transformations of curves on the plane.

We enrich pregroups with a mapping which allows us to locally apply precyclic permutations to designated substrings. We prove a normalisation theorem for such algebraic structures and briefly formalise some known applications of pregroups…

Multiword expressions (MWEs) are a heterogeneous set with a glaring need for classifications. Designing a satisfactory classification involves choosing features. In the case of MWEs, many features are a priori available. Not all features…

We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language -- which is the number of its (left) quotients, and…

We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…