Related papers: (k,l)-Unambiguity and Quasi-Deterministic Structur…

Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…

We distinguish a class of irreducible finite representations of conformal Lie (super)algebras. These representations (called universally defined) are the simplest ones from the computational point of view: a universally defined…

The state complexity of a finite(-state) automaton intuitively measures the size of the description of the automaton. Sakoda and Sipser [STOC 1972, pp. 275--286] were concerned with nonuniform families of finite automata and they discussed…

We observe that the classical Cartesian product construction for the intersection of (languages of) nondeterministic finite automata (NFA) is non-optimal in the worst case, if the automata have many transitions. For a fixed alphabet, the…

In this paper we apply algebraic $K$-theory techniques to construct a Fuglede-Kadison type determinant for a semi-finite von Neumann algebra equipped with a fixed trace. Our construction is based on the approach to determinants for Banach…

Multi-head finite automata were introduced in (Rabin, 1964) and (Rosenberg, 1966). Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these…

In this paper we show that the $\mathrm{K}$-homology groups of a separable C*-algebra can be enriched with additional descriptive set-theoretic information, and regarded as definable groups. Using a definable version of the Universal…

We introduce a certain restriction of weighted automata over the rationals, called image-binary automata. We show that such automata accept the regular languages, can be exponentially more succinct than corresponding NFAs, and allow for…

We examine the behaviors of various models of $k$-limited automata, which naturally extend Hibbard's [Inf. Control, vol. 11, pp. 196--238, 1967] scan limited automata, each of which is a single-tape linear-bounded automaton satisfying the…

Previously, self-verifying symmetric difference automata were defined and a tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n at least 2, there is a…

The communication matrix for two-way deterministic finite automata (2DFA) with $n$ states is defined for an automaton over a full alphabet of all $(2n+1)^n$ possible symbols: its rows and columns are indexed by strings, and the entry $(u,…

We give a canonical representation for trim acyclic deterministic finite automata (Adfa) with n states over an alphabet of k symbols. Using this normal form, we present a backtracking algorithm for the exact generation of Adfas. This…

The subject of this paper is six-dimensional nearly (para-)K\"ahler geometry with pseudo-Riemannian metrics. Firstly, we derive the analogue of the well-known exterior differential system characterising a nearly K\"ahler manifold and prove…

We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a…

We show that there are quantum devices that accept all regular languages and that are exponentially more concise than deterministic finite automata (DFA). For this purpose, we introduce a new computing model of {\it one-way quantum finite…

This paper provides a coalgebraic approach to the language semantics of two types of non-deterministic automata over nominal sets: non-deterministic orbit-finite automata (NOFAs) and regular nominal non-deterministic automata (RNNAs), which…

Suitable extensions of the monadic second-order theory of k successors have been proposed in the literature to capture the notion of time granularity. In this paper, we provide the monadic second-order theories of downward unbounded layered…

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. $\textit{Complement:}$ There is a language $L$ recognised by an $n$-state UFA such…

We prove new parameterization theorems for sets definable in the structure $\mathbb{R}_{an}$ (i.e. for globally subanalytic sets) which are uniform for definable families of such sets. We treat both $C^r$-parameterization and (mild)…

Let $(G,g)$ be a 4-dimensional Riemannian Lie group with a 2-dimensional left-invariant, conformal foliation $\mathcal{F}$ with minimal leaves. Let $J$ be an almost Hermitian structure on $G$ adapted to the foliation $\mathcal{F}$. The…