Descriptional Complexity of Deterministic Regular Expressions

DOI10.1007/978-3-642-32589-2_56zbMath1338.68153OpenAlexW126116262MaRDI QIDQ2912763

Katja Losemann, Matthias Niewerth, Wim Martens

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_56

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Closure properties and descriptional complexity of deterministic regular expressions ⋮ Deciding definability by deterministic regular expressions ⋮ Definability by Weakly Deterministic Regular Expressions with Counters is Decidable ⋮ Deciding determinism of unary languages ⋮ Deciding determinism of regular languages

This page was built for publication: Descriptional Complexity of Deterministic Regular Expressions