Related papers: A Tight Lower Bound for Streett Complementation
In this work, we exploit the power of \emph{finite ambiguity} for the complementation problem of B\"uchi automata by using reduced run directed acyclic graphs (DAGs) over infinite words, in which each vertex has at most one predecessor;…
We prove a lower bound of $\Omega(n^2/\log^2 n)$ on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial $f(x_1, \ldots, x_n)$. Our approach expands and improves upon a result of Raz,…
For online matching with the line metric, we present a lower bound of $\Omega(\log n)$ on the approximation ratio of any online (possibly randomized) algorithm. This beats the previous best lower bound of $\Omega(\sqrt{\log n})$ and matches…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
We show that every two-way deterministic finite automaton (2DFA) that solves one-way liveness on height h has Omega(h^2) states. This implies a quadratic lower bound for converting one-way nondeterministic finite automata to 2DFAs, which…
Asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity of a class of dynamic programming algorithms including matrix chain multiplication, optimal polygon triangulation, and the construction of optimal binary…
Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…
An automaton is synchronizing if there is a word that maps all states onto the same state. \v{C}ern\'{y}'s conjecture on the length of the shortest such word is probably the most famous open problem in automata theory. We consider the…
In 1964 \v{C}ern\'{y} conjectured that each $n$-state synchronizing automaton posesses a reset word of length at most $(n-1)^2$. From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in…
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite…
We present counting reward automata-a finite state machine variant capable of modelling any reward function expressible as a formal language. Unlike previous approaches, which are limited to the expression of tasks as regular languages, our…
We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of $\omega$-regular expressions…
We prove the first nontrivial worst-case lower bounds for two closely related problems. First, $\Omega(n^{3/2})$ degree-1 reductions, series-parallel reductions, and $\Delta$Y transformations are required in the worst case to reduce an…
In this paper we provide an explicit bound for $|\zeta(1+it)|$ in the form of $|\zeta(1+it)|\leq \min\left(\log t, \frac{1}{2}\log t+1.93, \frac{1}{5}\log t+44.02 \right)$. This improves on the current best-known explicit bound of…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
We introduce layered automata, a subclass of alternating parity automata that generalises deterministic automata. Assuming a consistency property, these automata are history deterministic and 0-1 probabilistic. We show that every…
In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial…
Consider a nonuniformly hyperbolic map $ T $ modelled by a Young tower with tails of the form $ O(n^{-\beta}) $, $ \beta>2 $. We prove optimal moment bounds for Birkhoff sums $ \sum_{i=0}^{n-1}v\circ T^i $ and iterated sums $ \sum_{0\le…
In this work, we exploit the power of \emph{unambiguity} for the complementation problem of B\"uchi automata by utilizing reduced run directed acyclic graphs (DAGs) over infinite words, in which each vertex has at most one predecessor. We…