Property testing of regular languages with applications to streaming property testing of visibly pushdown languages

A straightforward algorithm constructing an au- tomaton recognizing the left full quotient of two reg- ular languages M and N is now provided.. This leads to

Since the hypotheses depend only on the abstract representing automaton and not on a particular embedding, we deduce an estimation of the genus of regular languages (Theorem

This means that it is not possible to obtain a recursive bound relating the size of context-free grammars generating regular languages with the number of states of

If n is the number of states of the min- imal deterministic automaton accepting the language, an O(n 3 )-time algorithm is obtained for extensible binary languages in [4], while an

In Section 3 we show that for regular languages there is a dichotomy between polynomial and exponential antichain growth, and give a polynomial-time algorithm for distinguishing the

has received grant support from the Federal Austrian Ministry of Health, honoraria or travel support for consulting or lecturing from the following companies and legal entities:

As the example above illustrates, the main advantage of using our verified testing framework is the ability to carry out abstract (possibilistic) correctness proofs of test- ing

A testing approach is any good only if it uncovers bugs, but we were not expecting to find any in the model presented in the paper, which came equipped with a type soundness