Generalized One-Unambiguity

  • Pascal Caron
  • Yo-Sub Han
  • Ludovic Mignot
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)
Cite this paper as:
Caron P., Han YS., Mignot L. (2011) Generalized One-Unambiguity. In: Mauri G., Leporati A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Pascal Caron
    • 1
  • Yo-Sub Han
    • 2
  • Ludovic Mignot
    • 1
  1. 1.LITISUniversité de RouenSaint-Étienne du Rouvray CedexFrance
  2. 2.Dept. of Computer ScienceYonsei UniversitySeoulRepublic of Korea

Personalised recommendations