# Cover Complexity of Finite Languages

```@inproceedings{Hetzl2018CoverCO,
title={Cover Complexity of Finite Languages},
author={Stefan Hetzl and Simon Wolfsteiner},
booktitle={DCFS},
year={2018}
}```
• Published in DCFS 25 July 2018
• Computer Science, Linguistics
We consider the notion of cover complexity of finite languages on three different levels of abstraction. For arbitrary cover complexity measures, we give a characterisation of the situations in which they collapse to a bounded complexity measure. Moreover, we show for a restricted class of context-free grammars that its grammatical cover complexity measure w.r.t. a finite language L is unbounded and that the cover complexity of L can be computed from the exact complexities of a finite number of…
2 Citations

### On the cover complexity of finite languages

• Computer Science, Linguistics
Theor. Comput. Sci.
• 2019

### On the Grammatical Complexity of Finite Languages

• Computer Science, Linguistics
DCFS
• 2018
This work studies the grammatical production complexity of finite languages w.r.t. whether the underlying grammar generates a finite or infinite language, and obtains six different measures for regular, linear context-free, and context- free grammars.

## References

SHOWING 1-10 OF 20 REFERENCES

### Minimal cover-automata for finite languages

• Computer Science, Linguistics
Theor. Comput. Sci.
• 1998
This paper describes an efficient algorithm that, for a given DFA accepting a finite language, constructs a minimal deterministic finite cover- automaton of the language and gives algorithms for the boolean operations on deterministic cover automata, i.e., on the finite languages they represent.

### Production Complexity of Some Operations on Context-Free Languages

• Computer Science
DCFS
• 2012
We investigate context-free languages with respect to the measure Prod of descriptional complexity, which gives the minimal number of productions necessary to generate the language. In particular, we

### On the size of context-free grammars

One more criterion of complexity of CFG's, namely Symb (G) = = the number of all occurrences of all symbols in the rules of G, is defined and some results concerning the criteria Prod and Symb are derived.

### Compressibility of Finite Languages by Grammars

• Computer Science
DCFS
• 2015
The central result of this paper is the construction of an incompressible sequence of finite word languages that is shown to transfer to tree languages and also to formal proofs in first-order predicate logic.