Descriptional Complexity of Deterministic Regular Expressions
نویسندگان
چکیده
We study the descriptional complexity of regular languages that are definable by deterministic regular expressions. First, we examine possible blow-ups when translating between regular expressions, deterministic regular expressions, and deterministic automata. Then we give an overview of the closure properties of these languages under various language-theoretic operations and we study the descriptional complexity of applying these operations. Our main technical result is a general property that implies that the blow-up when translating a DFA to an equivalent deterministic expression can be exponential.
منابع مشابه
Tight Bounds on the Descriptional Complexity of Regular Expressions
We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite automata to regular expressions, study the effect of the complementation operation on the descriptional complexity of regular expressions, and the conversion of regular expressions extended by adding intersection or interleavi...
متن کاملLanguage Operations with Regular Expressions of Polynomial Size
In the last 20 years, a large body of research on the descriptional complexity of finite automata has been developed. To the authors’ knowledge, the first systematic attempt to start a parallel development for the descriptional complexity of regular expressions was presented by Ellul et al. [4] at the workshop “Descriptional Complexity of Formal Systems” (DCFS), in 2002. In particular, they rai...
متن کاملDescriptional Complexity of NFAs of Different Ambiguity
In this paper, we study the tradeoffs in descriptional complexity of NFA (nondeterministic finite automata) of various amounts of ambiguity. We say that two classes of NFA are separated if one class can be exponentially more succinct in descriptional sizes than the other. New results are given for separating DFA (deterministic finite automata) from UFA (unambiguous finite automata), UFA from MD...
متن کاملFinite Automata, Digraph Connectivity, and Regular Expression Size
We study some descriptional complexity aspects of regular expressions. In particular, we give lower bounds on the minimum required size for the conversion of deterministic finite automata into regular expressions and on the required size of regular expressions resulting from applying some basic language operations on them, namely intersection, shuffle, and complement. Some of the lower bounds o...
متن کاملOn the Equivalence of Automata for KAT-expressions
Kleene algebra with tests (KAT) is a decidable equational system for program verification that uses both Kleene and Boolean algebras. In spite of KAT ’s elegance and success in providing theoretical solutions for several problems, not many efforts have been made towards obtaining tractable decision procedures that could be used in practical software verification tools. The main drawback of the ...
متن کامل