Sensing as a Complexity Measure

Part 1: Invited PapersInternational audienceThe size of deterministic automata required for recognizing regular and $\omega$-regular languages is a well-studied measure for the complexity of languages. We introduce and study a new complexity measure, based on the sensing required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and $\omega$-regular languages, as well as applications of the study in practice, especially in the monitoring and synthesis of reactive systems

Descriptional Complexity of Formal Systems

The proceedings contain 24 papers. The special focus in this conference is on Descriptional Complexity of Formal Systems. The topics include: Sensing as a complexity measure; avoiding overlaps in pictures; on the degree of nondeterminism of tree adjoining languages and head grammar languages; on the average complexity of strong star normal form; most complex non-returning regular languages; uncountable realtime probabilistic classes; a parametrized analysis of algorithms on hierarchical graphs; graph-controlled insertion-deletion systems generating language classes beyond linearity; computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors; self-attraction removal from oritatami systems; one-time nondeterministic computations; branching measures and nearly acyclic NFAS; a pumping lemma for ordered restarting automata; concise representations of reversible automata; reset complexity of ideal languages over a binary alphabet; state complexity of suffix distance and the quotient operation on input driven pushdown automata