Related papers: A note on Automatic Baire property
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
Let A^Z be the Cantor space of bi-infinite sequences in a finite alphabet A, and let sigma be the shift map on A^Z. A `cellular automaton' is a continuous, sigma-commuting self-map Phi of A^Z, and a `Phi-invariant subshift' is a closed,…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
We introduce and study adhesive spaces. Using this concept we obtain a characterization of stable Baire maps $f:X\to Y$ of the class $\alpha$ for wide classes of topological spaces. In particular, we prove that for a topological space $X$…
The purpose of this paper is to discuss the possibilities for computing machinery, or AI agents, to know and to possess knowledge. This is done mainly from a virtue epistemology perspective and definition of knowledge. However, this inquiry…
Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems using a combination of a decision procedure for a subset of first-order logic and symbolic methods originally developed for finite-state model…
This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree automata is part of Automata Theory and it touches the area of…
Artificial intelligence (AI) systems in high-stakes domains raise concerns about proxy discrimination, unfairness, and explainability. Existing audits often fail to reveal why unfairness arises, particularly when rooted in structural bias.…
We show an extention of a theorem of Kaczynski to boundary functions in n-dimensional space. Let $H$ denote the upper half-plane, and let $X$ denote its frontier, the $x$-axis. Suppose that $f$ is a function mapping $H$ into some metric…
For a metrizable space, we consider the space of all metrics generating the same topology of the metrizable space, and this space of metrics is equipped with the supremum metric. In this paper, for every metrizable space, we establish that…
We obtain dynamical lower bounds for some self-adjoint operators with pure point spectrum in terms of the spacing properties of their eigenvalues. In particular, it is shown that for systems with thick point spectrum, typically in Baire's…
Barrier billiards are simple examples of pseudo-integrable models which form an appealing but poorly investigated subclass of dynamical systems. The paper examines the semiclassical limit of the exact quantum transfer operator for barrier…
Automaton models are often seen as interpretable models. Interpretability itself is not well defined: it remains unclear what interpretability means without first explicitly specifying objectives or desired attributes. In this paper, we…
We characterize complete deterministic finite automata with two input letters in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word. The characterization leads to a…
Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an object that approximates this c.e. object. It turns out that,…
We study the uniform computational content of different versions of the Baire Category Theorem in the Weihrauch lattice. The Baire Category Theorem can be seen as a pigeonhole principle that states that a complete (i.e., "large") metric…
We answer two questions from {\it V.Bykov, On Baire class one functions on a product space, Topol. Appl. {199} (2016) 55--62,} and prove that every Baire one function on a subspace of a countable perfectly normal product is the pointwise…
It is proved that every function of finite Baire index on a separable metric space $K$ is a $D$-function, i.e., a difference of bounded semi-continuous functions on $K$. In fact it is a strong $D$-function, meaning it can be approximated…
An outlier is a datapoint that is set apart from a sample population. The outlier theorem in algorithmic information theory states that given a computable sampling method, outliers must appear. We present a simple proof to the outlier…
In a jumping finite automaton, the input head can jump to an arbitrary position within the remaining input after reading and consuming a symbol. We characterize the corresponding class of languages in terms of special shuffle expressions…