%0 Conference Proceedings
%T Descriptional Complexity and Operations – Two Non-classical Cases
%+ Otto-von-Guericke-Universität Magdeburg = Otto-von-Guericke University [Magdeburg] (OVGU)
%A Dassow, Jürgen
%Z Part 1: Invited Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Milano, Italy
%Y Giovanni Pighizzini
%Y Cezar Câmpeanu
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10316
%P 33-44
%8 2017-07-03
%D 2017
%R 10.1007/978-3-319-60252-3_3
%Z Computer Science [cs]Conference papers
%X For a language family $\mathcal{L}$, a syntactic complexity measure K defined on languages of $\mathcal{L}$, a number $n\ge 1$, and an n-ary operation $\circ $ under which $\mathcal{L}$ is closed, we define $g_{\circ }^K(m_1,m_2,\dots ,m_n)$ as the set of all integers r such that there are n languages $L_i$, $1\le i\le n$, with $ K(L_i)=m_i \text { for } 1\le i\le n \text { and } K(\circ (L_1,L_2,\dots ,L_n))=r. $In this paper we study these sets for the operation union, catenation, star, complement, set-subtraction, and intersection and the measure number of accepting states (defined for regular languages) as well as for reversal, union, catenation, and star and the measures number of nonterminals, productions, and symbols (defined for context-free languages).Moreover, we discuss the change of these sets if one restricts to finite languages, unary languages, and finite unary languages.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01657004/document
%2 https://inria.hal.science/hal-01657004/file/440206_1_En_3_Chapter.pdf
%L hal-01657004
%U https://inria.hal.science/hal-01657004
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10316