Skip to Main content Skip to Navigation
Conference papers

Descriptional Complexity of Bounded Regular Languages

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Monday, November 13, 2017 - 3:32:34 PM
Last modification on : Monday, February 26, 2018 - 1:40:02 PM
Long-term archiving on: : Wednesday, February 14, 2018 - 3:26:35 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads