The problem of computing the edit-distance between a string and a finite automaton arises in a variety of applications in computational biology, text processing, and speech recognition. This paper presents linear-space algorithms for computing the edit-distance between a string and an arbitrary weighted automaton over the tropical semiring, or an unambiguous weighted automaton over an arbitrary...

Let L(M) be the (factorial) language avoiding a given anti-factorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eeective if M is nite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm ...

We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a co-Büchi automaton for φ and an array of Rabin automata, one for each G-subformula of φ. The Rabin automaton for Gψ is in charge of recognizing whether FGψ holds. This information is passed to the co-Büchi automaton that decides on acceptance. As opposed ...

To oli showed that every cellular automaton of an arbitrary dimension d can be embedded into a reversible cellular automaton of dimension d+1. He asked \whether an arbitrary cellular automaton can be embedded in a reversible one having the same number of dimensions" and conjectured that this is not possible. We show that his conjecture is true. Even if one imposes only a weak, natural condition...

The suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata.We also characteri...

Given a non-deterministic timed automaton with silent transitions (eNTA), we show that after an initial stage it becomes timeperiodic. After computing the periodic parameters, we construct a finite almost periodic augmented region automaton, which includes a clock measuring the global time. In the next step we construct the timestamp of the automaton: the union of all its observable timed trace...

The complementation problem for nondeterministic word automata has numerous applications in formal verification. In order to check that the language of an automaton A1 is contained in the language of a second automaton A2, one checks that the intersection of A1 with an automaton that complements A2 is empty. Many problems in verification and design are reduced to language containment. In model ...

ion Refinement and Antichains for Trace Inclusion of Infinite State Systems Radu Iosif, Adam Rogalewicz, and Tomáš Vojnar CNRS/Verimag, France and FIT BUT, Czech Republic Abstract. A data automaton is a finite automaton equipped with variables (counA data automaton is a finite automaton equipped with variables (counters or registers) ranging over infinite data domains. A trace of a data automat...

We consider a deterministic finite automaton which accepts all subsequences of a set of texts, called subsequence automaton. We show an online algorithm for constructing subsequence automaton for a set of texts. It runs in O(|Σ|(m+ k) +N) time using O(|Σ|m) space, where |Σ| is the size of alphabet, m is the size of the resulting subsequence automaton, k is the number of texts, and N is the tota...

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a varia...