Closure properties and descriptional complexity of deterministic regular expressions

Katja Losemann, Wim Martens, Matthias Niewerth. Closure properties and descriptional complexity of deterministic regular expressions. Theoretical Computer Science, 627:54-70, 2016. [doi]

Abstract

Abstract is missing.