TY - GEN
T1 - Generalized one-unambiguity
AU - Caron, Pascal
AU - Han, Yo Sub
AU - Mignot, Ludovic
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=79960728437&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960728437&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22321-1_12
DO - 10.1007/978-3-642-22321-1_12
M3 - Conference contribution
AN - SCOPUS:79960728437
SN - 9783642223204
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 129
EP - 140
BT - Developments in Language Theory - 15th International Conference, DLT 2011, Proceedings
T2 - 15th International Conference on Developments in Language Theory, DLT 2011
Y2 - 19 July 2011 through 22 July 2011
ER -