Related papers: An Effective Extension of the Wagner Hierarchy to …
We show that, from the topological point of view, 2-tape B\"uchi automata have the same accepting power as Turing machines equipped with a B\"uchi acceptance condition. The Borel and the Wadge hierarchies of the class RAT_omega of…
Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A…
The present paper introduces and studies an alternative concept of two-way finite automata called input-erasing two-way finite automata. Like the original model, these new automata can also move the reading head freely left or right on the…
The notion of a symmetric extension extends the usual notion of forcing by identifying a particular class of names which forms an intermediate model of ZF between the ground model and the generic extension, and often the axiom of choice…
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means that we can construct the downward closure of the set of words…
We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations to languages accepted by permutation automata: union, quotient, complement,…
Different classes of automata on infinite words have different expressive power. Deciding whether a given language $L \subseteq \Sigma^\omega$ can be expressed by an automaton of a desired class can be reduced to deciding a game between…
An improved translation from alternating parity automata on infinite words to alternating weak automata is given. The blow-up of the number of states is related to the size of the smallest universal ordered trees and hence it is…
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…
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 study linear control systems in infinite--dimensional Banach spaces governed by analytic semigroups. For $p\in[1,\infty]$ and $\alpha\in\RR$ we introduce the notion of $L^p$--admissibility of type $\alpha$ for unbounded observation and…
In this paper we revisit Safra's determinization constructions for automata on infinite words. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Determinization is used in…
Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…
We study the language universality problem for One-Counter Nets, also known as 1-dimensional Vector Addition Systems with States (1-VASS), parameterized either with an initial counter value, or with an upper bound on the allowed counter…
Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even…
Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…
We establish the vector-valued Wiener type theorems for countable projective and inductive limits of quasi-Banach algebras in a weighted setting for both finite and infinite dimensional cases. As an application, we extend the notions of…
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…
The classical theorem of Erd\H os \& Wintner furnishes a criterion for the existence of a limiting distribution for a real, additive arithmetical function. This work is devoted to providing an effective estimate for the remainder term under…
We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative semantics says that a run of the…