Production complexity of some operations on context-free languages

Authors:
Jürgen Dassow;Ronny Harbich
Affiliations:
Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany;Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany
Venue:
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Year:
2012

Citing 6
Cited 0

The state complexities of some basic operations on regular languages

Theoretical Computer Science
State complexity of regular languages

Journal of Automata, Languages and Combinatorics
Handbook of Formal Languages

Handbook of Formal Languages
State Complexity of Basic Operations on Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Nonterminal Complexity of Some Operations on Context-Free Languages

Fundamenta Informaticae
State complexity of concatenation and complementation of regular languages

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 consider the behaviour of this measure with respect to operations. For given natural numbers c1,c2,…,cn and an n-ary operation τ on languages, we discuss the set gτ(c1,c2,…,cn) which is the range of Prod(τ(L1,L2,…, Ln)) where, for 1≤i≤n, Li is a context-free language with Prod(Li)=ci. The operations under discussion are union, concatenation, reversal, and Kleene closure.