Descriptional Complexity of Bounded Regular Languages - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Descriptional Complexity of Bounded Regular Languages

(1) , (1) , (1) , (1)


We investigate the descriptional complexity of the subregular language classes of (strongly) bounded regular languages. In the first part, we study the costs for the determinization of nondeterministic finite automata accepting strongly bounded regular languages. The upper bound for the costs is larger than the costs for determinizing unary regular languages, but lower than the costs for determinizing arbitrary regular languages. In the second part, we study for (strongly) bounded languages the deterministic operational state complexity of the Boolean operations as well as the operations reversal, concatenation, and iteration. In detail, we present upper and lower bounds and we develop for the proof of the lower bounds a tool that exploits the number of different colorings of cycles occurring in deterministic finite automata accepting bounded languages.
Fichier principal
Vignette du fichier
416473_1_En_11_Chapter.pdf (374.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01633949 , version 1 (13-11-2017)


Attribution - CC BY 4.0



Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt. Descriptional Complexity of Bounded Regular Languages. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.138-152, ⟨10.1007/978-3-319-41114-9_11⟩. ⟨hal-01633949⟩
50 View
245 Download



Gmail Facebook Twitter LinkedIn More