English
Related papers

Related papers: Combinatorial Characterization of Formal Languages

200 papers

The study of combinatorial properties of mathematical objects is a very important research field and continued fractions have been deeply studied in this sense. However, multidimensional continued fractions, which are a generalization…

Number Theory · Mathematics 2022-09-20 Michele Battagliola , Nadir Murru , Giordano Santilli

String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we introduce the joint string complexity as the cardinality of a set of words that are common to both strings.…

Information Theory · Computer Science 2018-05-24 Philippe Jacquet , Dimitris Milioris , Wojciech Szpankowski

Is there a characteristic of coordination languages that makes them qualitatively different from general programming languages and deserves special academic attention? This report proposes a nuanced answer in three parts. The first part…

Software Engineering · Computer Science 2013-06-17 Raphael 'kena' Poss

Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…

Probability · Mathematics 2013-08-16 Richard Arratia , Simon Tavare

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit…

Combinatorics · Mathematics 2007-05-23 Philippe Flajolet

This article presents a combinatorial result on indexed languages which was inspired by an attempt to understand the structure of groups with indexed language word problem. We show that a sufficiently long word in an indexed language can be…

Group Theory · Mathematics 2009-09-25 Robert Gilman

Quantitative linguistics has been allowed, in the last few decades, within the admittedly blurry boundaries of the field of complex systems. A growing host of applied mathematicians and statistical physicists devote their efforts to…

Computation and Language · Computer Science 2017-08-24 Damián H. Zanette

The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…

Combinatorics · Mathematics 2025-04-10 Jasem Hamoud , Duaa Abdullah

Compositionality in language refers to how much the meaning of some phrase can be decomposed into the meaning of its constituents and the way these constituents are combined. Based on the premise that substitution by synonyms is…

Computation and Language · Computer Science 2017-03-13 Christina Lioma , Niels Dalum Hansen

The review summarizes the main methodological concepts used in studying natural language from the perspective of complexity science and documents their applicability in identifying both universal and system-specific features of language in…

Physics and Society · Physics 2024-01-09 Tomasz Stanisz , Stanisław Drożdż , Jarosław Kwapień

This paper proposes a simple test for compositionality (i.e., literal usage) of a word or phrase in a context-specific way. The test is computationally simple, relying on no external resources and only uses a set of trained word vectors.…

Computation and Language · Computer Science 2016-11-30 Hongyu Gong , Suma Bhat , Pramod Viswanath

In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which…

Combinatorics · Mathematics 2024-10-04 Pierre Popoli , Jeffrey Shallit , Manon Stipulanti

Fibonacci word is the archetype of the Sturmian word, and it is one of the most studied of combinatorics on words. We studied the properties of the Fibonacci word and found its density for limited value then by calculating the limit…

Combinatorics · Mathematics 2025-04-10 Duaa Abdullah , Jasem Hamoud

We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on words. The extension is based on…

Discrete Mathematics · Computer Science 2023-01-02 Gabriele Fici , Svetlana Puzynina

Summarization is one of the key features of human intelligence. It plays an important role in understanding and representation. With rapid and continual expansion of texts, pictures and videos in cyberspace, automatic summarization becomes…

Computation and Language · Computer Science 2015-07-02 Hai Zhuge

Conceptual combination performs a fundamental role in creating the broad range of compound phrases utilized in everyday language. This article provides a novel probabilistic framework for assessing whether the semantics of conceptual…

Computation and Language · Computer Science 2014-11-24 Peter D. Bruza , Kirsty Kitto , Brentyn J. Ramm , Laurianne Sitbon

The paper presents a language model that develops syntactic structure and uses it to extract meaningful information from the word history, thus enabling the use of long distance dependencies. The model assigns probability to every joint…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba

Compositionality is a widely discussed property of natural languages, although its exact definition has been elusive. We focus on the proposal that compositionality can be assessed by measuring meaning-form correlation. We analyze…

Computation and Language · Computer Science 2020-12-08 Timothee Mickus , Timothée Bernard , Denis Paperno

We propose a formalism for representation of finite languages, referred to as the class of IDL-expressions, which combines concepts that were only considered in isolation in existing formalisms. The suggested applications are in natural…

Artificial Intelligence · Computer Science 2011-07-04 M. J. Nederhof , G. Satta