English
Related papers

Related papers: Shift spaces, Languages and Transfinite Induction

200 papers

We show that the spaces of transfinite words, namely ordinal-indexed words, over a Noetherian space, is also Noetherian, under a natural topology which we call the regular subword topology. We characterize its sobrification and its…

General Topology · Mathematics 2023-03-24 Jean Goubault-Larrecq , Simon Halfon , Aliaume Lopez

We introduce the notion of filtration between topologies and study its stabilization properties. Descriptive set theoretic complexity plays a role in this study. Filtrations lead to natural transfinite sequences approximating a given…

Logic · Mathematics 2020-04-15 Sławomir Solecki

A decidable transfinite hierarchy is defined by assigning ordinals to the programs of an imperative language. It singles out: the classes TIMEF(n^c) and TIMEF(n_c); the finite Grzegorczyk classes at and above the elementary level, and the…

Logic in Computer Science · Computer Science 2007-05-23 Salvatore Caporaso

Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations,…

Programming Languages · Computer Science 2020-09-23 Francesco Dagnino , Davide Ancona , Elena Zucca

We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal…

chao-dyn · Physics 2008-02-03 G. Troll

This paper concerns the intersection of natural language and the physical space around us in which we live, that we observe and/or imagine things within. Many important features of language have spatial connotations, for example, many…

Computation and Language · Computer Science 2021-09-17 Vincent Wang-Mascianica , Bob Coecke

Classes of Banach spaces that are finitely, strongly finitely or elementary equivalent are introduced. On sets of these classes topologies are defined in such a way that sets of defined classes become compact totally disconnected…

Functional Analysis · Mathematics 2007-05-23 Eugene Tokarev

The structure of subspaces of a Hilbert space that are invariant under unitary representations of a discrete group is related to a notion of Hilbert modules endowed with inner products taking values in spaces of unbounded operators. A…

Functional Analysis · Mathematics 2015-07-01 Davide Barbieri , Eugenio Hernández , Victoria Paternostro

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…

Logic · Mathematics 2023-08-09 Nadav Meir

Classification and invariants, with respect to basis changes, of finite dimensional algebras are considered. An invariant open, dense (in the Zariscki topology) subset of the space of structural constants is defined. The algebras with…

Rings and Algebras · Mathematics 2015-09-24 Ural Bekbaev

One of the key factors in language productivity and human cognition is the ability of systematic compositionality, which refers to understanding composed unseen examples of seen primitives. However, recent evidence reveals that the…

Computation and Language · Computer Science 2023-12-13 Chen Huang , Peixin Qin , Wenqiang Lei , Jiancheng Lv

We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…

Category Theory · Mathematics 2019-12-30 M. Gavrilovich

We present a notion of precompactness, and study some of its properties, in the context of apartness spaces whose apartness structure is not necessarily induced by any uniform one. The presentation lies entirely with a Bishop-style…

Logic in Computer Science · Computer Science 2015-07-01 Douglas S Bridges

In this note we propose an alternative definition for sliding block codes between shift spaces. This definition coincides with the usual definition in the case that the shift space is defined on a finite alphabet, but it encompass a larger…

Dynamical Systems · Mathematics 2018-02-15 Marcelo Sobottka , Daniel Gonçalves

Ott, Tomforde, and Willis proposed a useful compactification for one-sided shifts over infinite alphabets. Building from their idea we develop a notion of two-sided shift spaces over infinite alphabets, with an eye towards generalizing a…

Dynamical Systems · Mathematics 2018-02-15 Daniel Gonçalves , Marcelo Sobottka , Charles Starling

Transformers are arguably the main workhorse in recent Natural Language Processing research. By definition a Transformer is invariant with respect to reordering of the input. However, language is inherently sequential and word order is…

Computation and Language · Computer Science 2021-09-10 Philipp Dufter , Martin Schmitt , Hinrich Schütze

We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language). Determining such sequences is, therefore, reduced to a…

Functional Analysis · Mathematics 2020-11-17 Malte Gerhold , Michael Skeide

For a collection of subcategories satisfying a fixed set of conditions, for example thick subcategories of a triangulated category, we define a topological space called classifying space of subcategories. We show that this space classifies…

Category Theory · Mathematics 2017-09-12 Yong Liu

The purpose of this paper is twofold. First, we define the new spaces and investigate some topological and structural properties. Also, we compute dual spaces of new spaces which are help us in the characterization of matrix mappings.…

Functional Analysis · Mathematics 2016-11-21 Murat Kirisci

Concept induction requires the extraction and naming of concepts from noisy perceptual experience. For supervised approaches, as the number of concepts grows, so does the number of required training examples. Philosophers, psychologists,…

Machine Learning · Computer Science 2020-01-20 Brett D. Roads , Bradley C. Love