Brüggemann-Klein and Wood have introduced a new family of regular languages, the one-unambiguous regular languages, a very important notion in XML DTDs. A regular language L is one-unambiguous if and only if there exists a regular expression E over the operators of sum, catenation and Kleene star such that L(E)∈=∈L and the position automaton of E is deterministic. It implies that for a one-unambiguous expression, there exists an equivalent linear-size deterministic recognizer. In this paper, we extend the notion of one-unambiguity to weak one-unambiguity over regular expressions using the complement operator ¬. We show that a DFA with at most (n∈+∈2) states can be computed from a weakly one-unambiguous expression and that it is decidable whether or not a given DFA recognizes a weakly one-unambiguous language. © 2011 Springer-Verlag.
CITATION STYLE
Caron, P., Han, Y. S., & Mignot, L. (2011). Generalized one-unambiguity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 129–140). https://doi.org/10.1007/978-3-642-22321-1_12
Mendeley helps you to discover research relevant for your work.