Descriptional Complexity and Operations – Two Non-classical Cases - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Descriptional Complexity and Operations – Two Non-classical Cases


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.
Fichier principal
Vignette du fichier
440206_1_En_3_Chapter.pdf (277.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01657004 , version 1 (06-12-2017)





Jürgen Dassow. Descriptional Complexity and Operations – Two Non-classical Cases. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.33-44, ⟨10.1007/978-3-319-60252-3_3⟩. ⟨hal-01657004⟩
97 View
70 Download



Gmail Facebook Twitter LinkedIn More