Related papers: Exploring the Topological Entropy of Formal Langua…
The downward closure of a language $L$ of words is the set of all (not necessarily contiguous) subwords of members of $L$. It is well known that the downward closure of any language is regular. Although the downward closure seems to be a…
We study damped hyperbolic equations on the infinite line. We show that on the global attracting set $G$ the $\epsilon$-entropy (per unit length) exists in the topology of $W^{1,\infty}$. We also show that the topological entropy per unit…
We discuss a topological approach to words introduced by the author. Words on an arbitrary alphabet are approximated by Gauss words and then studied up to natural modifications inspired by the Reidemeister moves on knot diagrams. This leads…
In this paper we regard languages and their acceptors -- such as deterministic or weighted automata, transducers, or monoids -- as functors from input categories that specify the type of the languages and of the machines to categories that…
Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…
Morphological inflection is a popular task in sub-word NLP with both practical and cognitive applications. For years now, state-of-the-art systems have reported high, but also highly variable, performance across data sets and languages. We…
Probabilistic B\"uchi Automata (PBA) are randomized, finite state automata that process input strings of infinite length. Based on the threshold chosen for the acceptance probability, different classes of languages can be defined. In this…
We define the topological pressure for any sub-additive potentials of the countable discrete amenable group action and any given open cover. A local variational principle for the topological pressure is established.
First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…
A topological dynamical system $(X,f)$ induces two natural systems, one is on the probability measure spaces and other one is on the hyperspace. We introduce a concept for these two spaces, which is called entropy order, and prove that it…
In this study, the output of large language models (LLM) is considered an information source generating an unlimited sequence of symbols drawn from a finite alphabet. Given the probabilistic nature of modern LLMs, we assume a probabilistic…
We introduce a notion of entropy for automorphisms of discrete groups which admit amenable actions on a compact space. This entropy is dual to classical topological entropy in the sense that if G is discrete and abelian then our notion of…
Finite automata (FA) are a fundamental computational abstraction that is widely used in practice for various tasks in computer science, linguistics, biology, electrical engineering, and artificial intelligence. Given an input word, an FA…
We develop and explore the idea of recognition of languages (in the general sense of subsets of topological algebras) as preimages of clopen sets under continuous homomorphisms into Stone topological algebras. We obtain an Eilenberg…
We define a hierarchy of systems with topological completely positive entropy in the context of continuous countable amenable group actions on compact metric spaces. For each countable ordinal we construct a dynamical system on the…
We describe a "top down" approach for automated theorem proving (ATP). Researchers might usefully investigate the forms of the theorems mathematicians use in practice, carefully examine how they differ and are proved in practice, and code…
In this paper we study topological entropy and recurrence properties of non-autonomous dynamical system generated by a family of continuous self maps on a compact space X. Specially, we introduce the pseudo-entropy and…
In this article I deal with the notion of observation in the most fundamental sense and its representation by means of formal languages serving as expressional tools of formal-axiomatical theories. In doing so, I have taken this notion in…
The use of terms from natural and social scientific titles and abstracts is studied from the perspective of sublanguages and their specialized dictionaries. Different notions of sublanguage distinctiveness are explored. Objective methods…
We present a formal model developed to reason about topologies created by sensor ranges. This model is used to formalise the topological aspects of an existing counting algorithm to estimate the number of targets in the area covered by the…