-
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)
International audience -
Distribution of the number of accessible states in a random deterministic aut...
International audience -
Sequential ?
This paper is a survey where we try to organise the known answers to the question whether a given finite automaton with multiplicity in a semiring K is equivalent to a... -
A unifying framework for seed sensitivity and its application to subset seeds
We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed... -
Efficiency of Automata in Semi-Commutation Verification Techniques
Computing the image of a regular language by the transitive closure of a relation is a central question in Regular Model Checking. In a recent paper Bouajjani,... -
Bar Codes for Regular Languages
Regular expressions and finite automata represent regular languages. The link between these two mathematical structures is the subject of many research topics. Each... -
Product of Group Languages
International audience -
Online Location Tracking of a Single Inhabitant based on a State Estimator
International audience -
Formal definition of coherency and computation of minimal cut sequences for b...
Preventive risk assessment of a complex system rely on a dynamic models which describe the link between the system failure and the scenarios of failure and repair... -
Ein ereignisdiskreter Ansatz zur modellbasierten Lokalisierung der Bewohner i...
In den meisten Industrieländern ist die Lebenserwartung in den letzten Jahrzehnten fortlaufend gestiegen und wird höchstwahrscheinlich noch weiter steigen. Dieser... -
Finite Automata with Generalized Acceptance Criteria
International audience -
On the asymptotic enumeration of accessible automata
Automata, Logic and Semantics
