English
Related papers

Related papers: On the Self Shuffle Language

200 papers

Speech is a distinctive complex feature of human capabilities. In order to understand the physics underlying speech production, in this work we empirically analyse the statistics of large human speech datasets ranging several languages. We…

Physics and Society · Physics 2014-08-06 Jordi Luque , Bartolo Luque , Lucas Lacasa

An edit distance is a metric between words that quantifies how two words differ by counting the number of edit operations needed to transform one word into the other one. A word f is said isometric with respect to an edit distance if, for…

Formal Languages and Automata Theory · Computer Science 2023-03-07 Marcella Anselmo , Giuseppa Castiglione , Manuela Flores , Dora Giammarresi , Maria Madonia , Sabrina Mantaci

A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Gabriele Fici

Sentence formation is a highly structured, history-dependent, and sample-space reducing (SSR) process. While the first word in a sentence can be chosen from the entire vocabulary, typically, the freedom of choosing subsequent words gets…

Computation and Language · Computer Science 2018-12-31 Rudolf Hanel , Stefan Thurner

In 2007, Grytczuk conjecture that for any sequence $(\ell_i)_{i\ge1}$ of alphabets of size $3$ there exists a square-free infinite word $w$ such that for all $i$, the $i$-th letter of $w$ belongs to $\ell_i$. The result of Thue of 1906…

Combinatorics · Mathematics 2021-05-12 Matthieu Rosenfeld

The notion of Wheeler languages is rooted in the Burrows-Wheeler transform (BWT), one of the most central concepts in data compression and indexing. The BWT has been generalized to finite automata, the so-called Wheeler automata, by Gagie…

Formal Languages and Automata Theory · Computer Science 2025-04-29 Ruben Becker , Giuseppa Castiglione , Giovanna D'Agostino , Alberto Policriti , Nicola Prezza , Antonio Restivo , Brian Riccardi

A language dynamics model on a square lattice, which is an extension of the one popularized by Abrams and Strogatz [1], is analyzed using ODE bifurcation theory. For this model we are interested in the existence and spectral stability of…

Pattern Formation and Solitons · Physics 2021-02-16 T. Kapitula , P. G. Kevrekidis

We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an…

Formal Languages and Automata Theory · Computer Science 2015-03-24 Paul Bell , Daniel Reidenbach , Jeffrey Shallit

We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…

Combinatorics · Mathematics 2011-04-21 Nati Linial , Doron Puder

In the area of computer science focusing on creating machines that can engage on behaviors that humans consider intelligent. The ability to create intelligent machines has intrigued humans since ancient times and today with the advent of…

Artificial Intelligence · Computer Science 2010-06-24 Supriya Raheja , Smita Rajpal

The analysis of thousands of time series in different languages reveals that word usage presents oscillations with a prevalence of 16-year cycles, mounted on slowly varying trends. These components carry different information: while similar…

Neurons and Cognition · Quantitative Biology 2022-07-20 Alejandro Pardo Pintos , Diego E Shalom , Enzo Tagliazucchi , Gabriel Mindlin , Marcos A Trevisan

The combinatorics of squares in a word depends on how the equivalence of halves of the square is defined. We consider Abelian squares, parameterized squares, and order-preserving squares. The word $uv$ is an Abelian (parameterized,…

Discrete Mathematics · Computer Science 2016-04-11 Tomasz Kociumaka , Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń

A distinction is sometimes made between "statistical" and "subjective" probabilities. This is based on a distinction between "unique" events and "repeatable" events. We argue that this distinction is untenable, since all events are "unique"…

Artificial Intelligence · Computer Science 2013-04-11 Henry E. Kyburg

Recent approaches to human concept learning have successfully combined the power of symbolic, infinitely productive rule systems and statistical learning to explain our ability to learn new concepts from just a few examples. The aim of most…

Artificial Intelligence · Computer Science 2020-04-29 Pablo Tano , Sergio Romano , Mariano Sigman , Alejo Salles , Santiago Figueira

We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive…

Combinatorics · Mathematics 2023-10-24 Mohamed Slim Kammoun , Mylène Maïda

A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] \dots w[i_{k}]$, for some set of indices $1 \leq i_1 < i_2 < \dots < i_k \leq \lvert w\rvert$. A word $w$ is $k$-subsequence universal over an alphabet $\Sigma$ if every…

Formal Languages and Automata Theory · Computer Science 2023-11-20 Duncan Adamson , Pamela Fleischmann , Annika Huch , Tore Koß , Florin Manea , Dirk Nowotka

Languages and genes are both transmitted from generation to generation, with opportunity for differential reproduction and survivorship of forms. Here we apply a rigorous inference framework, drawn from population genetics, to distinguish…

Populations and Evolution · Quantitative Biology 2017-11-07 Christopher A. Ahern , Mitchell G. Newberry , Robin Clark , Joshua B. Plotkin

Every culture and language is unique. Our work expressly focuses on the uniqueness of culture and language in relation to human affect, specifically sentiment and emotion semantics, and how they manifest in social multimedia. We develop…

Multimedia · Computer Science 2015-10-08 Brendan Jou , Tao Chen , Nikolaos Pappas , Miriam Redi , Mercan Topkara , Shih-Fu Chang

Vocabulary learning by children can be characterized by many biases. When encountering a new word, children as well as adults, are biased towards assuming that it means something totally different from the words that they already know. To…

Computation and Language · Computer Science 2017-02-09 Ramon Ferrer-i-Cancho

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a…

Formal Languages and Automata Theory · Computer Science 2009-11-13 Paola Bonizzoni , Clelia De Felice , Rosalba Zizza