Related papers: Topological Entropy of Formal Languages
The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 01$ with probability $p$ and $1 \mapsto 10$ with probability $1-p$ for $0<p<1$ and where…
We introduce a method for analyzing the complexity of natural language processing tasks, and for predicting the difficulty new NLP tasks. Our complexity measures are derived from the Kolmogorov complexity of a class of automata --- {\it…
Soft uniform structures provide a way to speak about uniform closeness in a parameterized setting. Working over a fixed parameter set, we treat entourages as soft relations and introduce a notion of \emph{soft uniformity} whose axioms…
Syntax connects words to each other in very specific ways. Two words are syntactically connected if they depend directly on each other. Syntactic connections usually happen within a sentence. Gathering all those connection across several…
Calculation of topological order parameters, such as the topological entropy and topological mutual information, are used to determine whether states possess topological order. Their calculation is expected to give reliable results when the…
Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…
To study arithmetic structures of natural numbers, we introduce a notion of entropy of arithmetic functions, called anqie entropy. This entropy possesses some crucial properties common to both Shannon's and Kolmogorov's entropies. We show…
Nonterminal complexity of a context-free language is the smallest possible number of nonterminals in its generating grammar. While in general case nonterminal complexity computation problem is unsolvable, it can be computed for different…
We define and investigate a notion of entropy for quantum error correcting codes. The entropy of a code for a given quantum channel has a number of equivalent realisations, such as through the coefficients associated with the Knill-Laflamme…
We show, when $G$ is a nilpotent or reductive Lie group, that the entropy of any surjective endomorphism coincides with the entropy of its restriction to the toral component of the center of $G$. In particular, if $G$ is a semi-simple Lie…
The study of semantic relationships has revealed a close connection between these relationships and the morphological characteristics of a language. Morphology, as a subfield of linguistics, investigates the internal structure and formation…
Let $f$ be a $C^r$ ($r>1$) diffeomorphism on a compact surface $M$ with $h_{\rm top}(f)\geq\frac{\lambda^{+}(f)}{r}$ where $\lambda^{+}(f):=\lim_{n\to+\infty}\frac{1}{n}\max_{x\in M}\log \left\|Df^{n}_{x}\right\|$. We establish an…
State-of-the-art language generation models can degenerate when applied to open-ended generation problems such as text completion, story generation, or dialog modeling. This degeneration usually shows up in the form of incoherence, lack of…
In our previous paper [9], we have introduced topological nearly entropy, Ent_N (f) by restricting X into a class of nearly compact spaces. In the present paper, some additional properties of this notion are studied. Furthermore, we…
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the…
Written language is complex. A written text can be considered an attempt to convey a meaningful message which ends up being constrained by language rules, context dependence and highly redundant in its use of resources. Despite all these…
We consider words as a network of interacting letters, and approximate the probability distribution of states taken on by this network. Despite the intuition that the rules of English spelling are highly combinatorial (and arbitrary), we…
In this paper we calculate the entanglement entropy for topological interfaces in rational conformal field theories for the case where the interface lies at the boundary of the entangling interval and for the case where it is located in the…
The topological entropy dimension is mainly used to distinguish the zero topological entropy systems. Two types of topological entropy dimensions, the classical entropy dimension and the Pesin entropy dimension, are investigated for…