A. Br uggemann-Klein, Regular expressions into finite automata, Theoretical Computer Science, 120, 1993, 197-213. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Generic Validation of Structural Content with Parametric Modules - Chuang (2001) (Correct)
....content models, based on theory of regular languages and finite automata [7, 8] In particular, they showed that linear time suffices to decide whether a content model is ambiguous. It is showed that regular expressions in both star normal form and epsilon normal form are always unambiguous [9]. The Glushkov automaton that corresponds to a regular expression is used for checking ambiguity and, if not unambiguous, for validation as well. Murata has proposed a data model for XML document transformation that is based on forest regular language theory [15, 16] His model is a lightweight ....
Anne Bruggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120(2):197--213, 1993.
Deterministic Regular Languages - Brüggemann-Klein, Wood (1991) (Correct)
....expressions E the canonical NFA ME is already deterministic. Such expressions are exactly what we have called deterministic above. It can be tested in linear time whether a regular expression is deterministic, and if so, the canonical deterministic automaton can also be constructed in linear time [Bru]. In this paper, we first give a rigorous definition of deterministic regular expressions. Then, we investigate the deterministic regular languages, i.e. regular languages that can be denoted by a deterministic expression. As we will see, the deterministic regular languages are a proper subclass ....
..... Figure 2 The inductive definition of ME . 8 Proposition 2.2 Given a regular expression E, we can decide if it is deterministic in time linear in the size of E. Proof The Glushkov automaton can be constructed from E in such a way that a new transition is introduced at each computation step [Bru]. As soon as we encounter a transition that makes the automaton under construction non deterministic, we stop and report E to be non deterministic. At this point, only time linear in the size of E has been spent. 2 Book et al. BEGO71] have defined a regular expression E to be unambiguous if the ....
Anne Bruggemann-Klein. Regular expressions into finite automata. To appear in the conference proceedings of Latin '92.
Characterization of Glushkov automata - Pascal Caron And (1998) (7 citations) (Correct)
No context found.
A. Br uggemann-Klein, Regular expressions into finite automata, Theoretical Computer Science, 120, 1993, 197-213.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC