Related papers: Simplicity and irreducibility in circular automata

In a recent paper we introduced a new framework for the study of call by need computations to normal form and root-stable form in term rewriting. Using elementary tree automata techniques and ground tree transducers we obtained simple…

We study the spectra of non-regular semisimple elements in irreducible representations of simple algebraic groups. More precisely, we prove that if G is a simply connected simple linear algebraic group and f is a non-trivial irreducible…

We define a sound and complete proof system for affine beta-eta-retractions in simple types built over many atoms, and we state simple necessary conditions for arbitrary beta-eta-retractions in simple and polymorphic types.

In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…

An automaton is history-deterministic if its nondeterminism can be resolved on the fly, only using the prefix of the word read so far. This mild form of nondeterminism has attracted particular attention for its applications in synthesis…

There is a widespread perception that dynamical evolution of integrable systems should be simpler in a quantifiable sense than the evolution of generic systems, though demonstrating this relation between integrability and reduced complexity…

Real-world computers have operational constraints that cause nonzero entropy production (EP). In particular, almost all real-world computers are ``periodic'', iteratively undergoing the same physical process; and ``local", in that…

We will prove bi-interpretability of the arithmetic $\N = \langle N, +,\cdot, 0, 1\rangle$ and the weak second order theory of $\N$ with the free monoid $\mathbb{M}_X$ of finite rank greater than 1 and with a non-trivial partially…

Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run, thereby preserving many of the desirable algorithmic properties of finite automata. Here, we study the…

We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data. Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using…

Given an order of the underlying alphabet we can lift it to the states of a finite deterministic automaton: to compare states we use the order of the strings reaching them. When the order on strings is the co-lexicographic one \emph{and}…

We develop a systematic approach to continuous substitutions on compact Hausdorff alphabets. Focussing on implications of irreducibility and primitivity, we highlight important features of the topological dynamics of their (generalised)…

Let $F$ be a function field over $\mathbb{F}_q$, $A$ its ring of regular functions outside a place $\infty$ and $\mathfrak{p}$ a prime ideal of $A$. First, we develop Hida theory for Drinfeld modular forms of rank $r$ which are of slope…

There is an apparent similarity between the descriptions of small-step operational semantics of imperative programs and the semantics of finite automata, so defining an abstraction mapping from semantics to automata and proving a simulation…

We make the simple, and yet deep, observation that a regular conditional distribution (rcd) almost surely trivialises the conditioning $\sigma$-algebra if and only if there exists a "measurable selection" of regular conditional…

A deterministic finite automaton (DFA) is composite if its language can be decomposed into an intersection of languages of smaller DFAs. Otherwise, A is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and…

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…

We explore an alternative definition of unit in a monoidal category originally due to Saavedra: a Saavedra unit is a cancellative idempotent (in a 1-categorical sense). This notion is more economical than the usual notion in terms of…

We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reasoning only over finite execution fragments. Current…