English
Related papers

Related papers: Commutative positive varieties of languages

200 papers

We define a quantity $c_m(n,k)$ as a generalization of the notion of the composition of the positive integer $n$ into $k$ parts. We proceed to derive some known properties of this quantity. In particular, we relate two partial Bell…

Combinatorics · Mathematics 2017-02-07 Milan Janjić

Weakly and strongly quasiperiodic morphisms are tools introduced to study quasiperiodic words. Formally they map respectively at least one or any non-quasiperiodic word to a quasiperiodic word. Considering them both on finite and infinite…

Discrete Mathematics · Computer Science 2013-09-23 Florence Levé , Gwénaël Richomme

We study the shifted convolution sums associated to completely multiplicative functions taking values in $\{\pm 1\}$ and give combinatorical proofs of two recent results in the direction of Chowla's conjecture. We also determine the…

Number Theory · Mathematics 2025-03-11 Krishnarjun Krishnamoorthy

We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…

Formal Languages and Automata Theory · Computer Science 2018-02-22 Georg Zetzsche

A language is dense if the set of all infixes (or subwords) of the language is the set of all words. Here, it is shown that it is decidable whether the language accepted by a nondeterministic Turing machine with a one-way read-only input…

Formal Languages and Automata Theory · Computer Science 2019-03-08 Oscar H. Ibarra , Ian McQuillan

We consider the following practical question: given a finite algebra A in a finite language, can we efficiently decide whether the variety generated by A has a difference term? We answer this question (positively) in the idempotent case and…

Logic · Mathematics 2021-01-08 William DeMeo , Ralph Freese , Matthew Valeriote

Computational morphology handles the language processing at the word level. It is one of the foundational tasks in the NLP pipeline for the development of higher level NLP applications. It mainly deals with the processing of words and word…

Computation and Language · Computer Science 2024-06-11 Jatayu Baxi , Brijesh Bhatt

Words shift in meaning for many reasons, including cultural factors like new technologies and regular linguistic processes like subjectification. Understanding the evolution of language and culture requires disentangling these underlying…

Computation and Language · Computer Science 2016-09-27 William L. Hamilton , Jure Leskovec , Dan Jurafsky

Human communication systems, such as language, evolve culturally; their components undergo reproduction and variation. However, a role for selection in cultural evolutionary dynamics is less clear. Often neutral evolution (also known as…

Social and Information Networks · Computer Science 2014-07-01 Nicolas Fay , Monica Tamariz , T Mark Ellison , Dale Barr

We investigate the state complexity of the shuffle operation on regular languages initiated by Campeanu et al. and studied subsequently by Brzozowski et al. We shift the problem into the combinatorics domain by turning the problem of state…

Formal Languages and Automata Theory · Computer Science 2019-05-21 Pascal Caron , Jean-Gabriel Luque , Bruno Patrou

This article presents a review of quantum computing research works for Natural Language Processing (NLP). Their goal is to improve the performance of current models, and to provide a better representation of several linguistic phenomena,…

Computation and Language · Computer Science 2024-06-25 Sabrina Campano , Tahar Nabil , Meryl Bothua

We study classical structures in various categories of completely positive morphisms: on sets and relations, on cobordisms, on a free dagger compact category, and on Hilbert spaces. As an application, we prove that quantum maps with…

Quantum Physics · Physics 2012-10-03 Chris Heunen , Sergio Boixo

Mutexes (i.e., locks) are well understood in separation logic, and can be specified in terms of either protecting an invariant or atomically changing the state of the lock. In this abstract, we develop the same styles of specifications for…

Programming Languages · Computer Science 2026-02-02 Ke Du , William Mansky , Paolo G. Giarrusso , Gregory Malecha

In this paper, we count a dual set of Stirling permutations by the number of alternating runs. Properties of the generating functions, including recurrence relations, grammatical interpretations and convolution formulas are studied.

Combinatorics · Mathematics 2019-02-20 Shi-Mei Ma , Hai-Na Wang

Our languages are in constant flux driven by external factors such as cultural, societal and technological changes, as well as by only partially understood internal motivations. Words acquire new meanings and lose old senses, new words are…

Computation and Language · Computer Science 2019-03-14 Nina Tahmasebi , Lars Borin , Adam Jatowt

We here construct an explicit isomorphism between any commutative Hopf algebra which underlying coalgebra is the tensor coalgebra of a space $V$ and the shuffle algebra based on the same space. This isomorphism uses the commutative…

Combinatorics · Mathematics 2024-03-14 Loïc Foissy , Frédéric Patras

On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…

Logic in Computer Science · Computer Science 2022-04-11 Rafael Romero , Alejandro Díaz-Caro

We study the properties of shifted vertex operator algebras, which are vertex algebras derived from a given theory by shifting the conformal vector. In this way, we are able to exhibit large numbers of vertex operator algebras which are…

Quantum Algebra · Mathematics 2007-05-23 Chongying Dong , Geoffrey Mason

Hairpin completion and its variant called bounded hairpin completion are operations on formal languages, inspired by a hairpin formation in molecular biology. Another variant called hairpin lengthening has been recently introduced and…

Formal Languages and Automata Theory · Computer Science 2011-11-28 Fumiya Okubo , Takashi Yokomori

In this article we revisit a new notion of positivity in real semisimple Lie groups that at the same time generalizes total positivity in split real Lie groups as well as positive Lie semigroups in Hermitian Lie groups of tube type. We…

Group Theory · Mathematics 2025-11-18 Anna Wienhard