We devise a lower bound technique relying on boundedly generated lattices of languages, and give two applications of this technique. The first is a hierarchy ...
Dec 21, 2019 · Abstract:This paper studies the complexity of languages of finite words using automata theory. To go beyond the class of regular languages, ...
Lower bounds for the state complexity of probabilistic languages ... - HAL
hal.science › hal-02503349
We devise a lower bound technique relying on boundedly generated lattices of languages, and give two applications of this technique. The first is a hierarchy ...
We devise a lower bound technique relying on boundedly generated lattices of languages, and give two applications of this technique. The first is a hierarchy ...
Title: Lower bounds for the state complexity of probabilistic languages and the language of prime numbers. Authors: Nathanaël Fijalkow. Comments: Submitted to ...
Abstract. The notion of Online State Complexity, introduced by Karp in 1967, quantifies the amount of states required to solve a given problem using an ...
We improve the known bounds on the number of pairwise non-isomorphic minimal deterministic finite automata (DFAs) on n states which accept finite languages.
The second result is to give lower bounds on the alternating state complexity of the language of prime numbers; we show that it is not sublinear, which is ...
The best lower bound from circuit complexity is due to Allender, Saks and Shparlinski: they proved unconditionally in 2001 that Primes is not in AC 0 [p] for ...
We show that when considering “almost all boolean functions” the most precise lower bound can be given either by Yao's lower bound or by our entropic lower.