Intersection and union of regular languages and state complexity
Information Processing Letters
SIAM Journal on Computing
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the state complexity of reversals of regular languages
Theoretical Computer Science
Formal languages and their relation to automata
Formal languages and their relation to automata
On the State Minimization of Nondeterministic Finite Automata
IEEE Transactions on Computers
Finite automata and their decision problems
IBM Journal of Research and Development
The Tractability Frontier for NFA Minimization
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Lower bounds for the transition complexity of NFAs
Journal of Computer and System Sciences
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Theoretical Computer Science
Language operations with regular expressions of polynomial size
Theoretical Computer Science
Descriptional complexity of nondeterministic finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Limitations of lower bound methods for deterministic nested word automata
Information and Computation
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Comparing necessary conditions for recognizability of two-dimensional languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
Lower bounds for the transition complexity of NFAs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Some minimality results on biresidual and biseparable automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
From equivalence to almost-equivalence, and beyond--minimizing automata with errors
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Hi-index | 0.00 |
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is shown that the maximal attainable lower bound for each of the above mentioned techniques can be algorithmically deduced from a canonical finite graph, the so called dependency graph of a regular language. This graph is very helpful when comparing the techniques with each other and with nondeterministic state complexity. In most cases it is shown that for any two techniques the gap between the best bounds can be arbitrarily large. Moreover, we show that deciding whether a certain lower bound w.r.t. one of the investigated techniques can be achieved is in most cases computationally hard, i.e., PSPACE-complete and hence is as hard as minimizing nondeterministic finite automata.