The state complexities of some basic operations on regular languages
Theoretical Computer Science
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Descriptional complexity of nondeterministic finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Production complexity of some operations on context-free languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |
We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals necessary to generate a language. More specifically, we consider the behaviour of this measure with respect to language-theoretic operations. For given numbers c$_1$, c$_2$, …, c$_n$ and an n-ary operation τ on language, we discuss the range of Var (τ(L$_1$,L$_2$,…L$_n$)) where for 1 ⩽i⩽n, L$_i$ is a context-free language with Var (L$_i$) = c$_i$. The operations under discussion are the six AFL-operations: union, concatenation, Kleene-closure, homomorphisms, inverse homomorphisms and intersections by regular sets.