Generalized one-unambiguity

Pascal Caron; Yo Sub Han; Ludovic Mignot

doi:10.1007/978-3-642-22321-1_12

Generalized one-unambiguity

Pascal Caron, Yo Sub Han, Ludovic Mignot

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

10 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	Developments in Language Theory - 15th International Conference, DLT 2011, Proceedings
Pages	129-140
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-22321-1_12
Publication status	Published - 2011 Jul 29
Event	15th International Conference on Developments in Language Theory, DLT 2011 - Milan, Italy Duration: 2011 Jul 19 → 2011 Jul 22

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6795 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	15th International Conference on Developments in Language Theory, DLT 2011
Country	Italy
City	Milan
Period	11/7/19 → 11/7/22

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-22321-1_12

Fingerprint Dive into the research topics of 'Generalized one-unambiguity'. Together they form a unique fingerprint.

Cite this

Caron, P., Han, Y. S., & Mignot, L. (2011). Generalized one-unambiguity. In Developments in Language Theory - 15th International Conference, DLT 2011, Proceedings (pp. 129-140). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6795 LNCS). https://doi.org/10.1007/978-3-642-22321-1_12

@inproceedings{67a6b2ff00a941898d8f0711967626cd,

title = "Generalized one-unambiguity",

abstract = "Br{\"u}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.",

author = "Pascal Caron and Han, {Yo Sub} and Ludovic Mignot",

year = "2011",

month = jul,

day = "29",

doi = "10.1007/978-3-642-22321-1_12",

language = "English",

isbn = "9783642223204",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "129--140",

booktitle = "Developments in Language Theory - 15th International Conference, DLT 2011, Proceedings",

note = "15th International Conference on Developments in Language Theory, DLT 2011 ; Conference date: 19-07-2011 Through 22-07-2011",

}

Caron, P, Han, YS & Mignot, L 2011, Generalized one-unambiguity. in Developments in Language Theory - 15th International Conference, DLT 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6795 LNCS, pp. 129-140, 15th International Conference on Developments in Language Theory, DLT 2011, Milan, Italy, 11/7/19. https://doi.org/10.1007/978-3-642-22321-1_12

Generalized one-unambiguity. / Caron, Pascal; Han, Yo Sub; Mignot, Ludovic.

Developments in Language Theory - 15th International Conference, DLT 2011, Proceedings. 2011. p. 129-140 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6795 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Generalized one-unambiguity

AU - Caron, Pascal

AU - Han, Yo Sub

AU - Mignot, Ludovic

PY - 2011/7/29

Y1 - 2011/7/29

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 -