Characterization of Glushkov automata

Caron, Pascal; Ziadi, Djelloul

doi:10.1016/s0304-3975(97)00296-x

Cited by 78 publications

(38 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has many practical applications and is very simple for understanding and extension. In [4] the alternative automaton (known as a Glushkov automaton) was well-studied and characterized, obviously, Glushkov automaton can be constructed from Thompson's by applying the following-rule: This case has one more proof of Thompson's method of universality and applicability even for large cases as automaton has as fewer states as the input regular expression. For the follow automaton this bound is quadratic due to Kleene-star explosion.…”

Section: Known Algorithmsmentioning

confidence: 99%

Deterministic automata for extended regular expressions

Syzdykov¹

2017

Open Computer Science

View full text Add to dashboard Cite

Abstract:In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement. The method like "overriding" of the source NFA(NFA not defined) with subset construction rules is used. The past work described only the algorithm for AND-operator (or intersection of regular languages); in this paper the construction for the MINUS-operator (and complement) is shown.

show abstract

Section: Known Algorithmsmentioning

confidence: 99%

Deterministic automata for extended regular expressions

Syzdykov¹

2017

Open Computer Science

View full text Add to dashboard Cite

show abstract

“…In the following, we assume that D is a DTD over the labels L and l ∈ L. There is a well-known process to transform a regular expression, such as e(l), into a Glushkov automaton [6]. We discuss this process briefly here.…”

Section: Graph Representation Of a Dtdmentioning

confidence: 99%

Generating XML structure using examples and constraints

Cohen

2008

Proc. VLDB Endow.

View full text Add to dashboard Cite

This paper presents a framework for automatically generating structural XML documents. The user provides a target DTD and an example of an XML document, called a Generate-XML-ByExample Document, or a GxBE document, for short. GxBE documents use a natural declarative syntax, which includes XPath expressions and the function count. Using GxBE documents, users can express important global and local characteristics for the desired target documents, and can require satisfaction of XPath expressions from a given workload. This paper explores the problem of efficiently generating a document that satisfies a given DTD and GxBE document.

show abstract

“…In [27], Caron and Ziadi have described an algorithm, say Θ, which decides whether or not an automaton A is the standard automaton of an expression E; and if the answer is positive, Θ moreover computes an expression which is almost E, namely the star normal form of E as defined by Brüggemann-Klein [22]. Even if Θ is not properly a Φ-type algorithm since it does not compute an expression for every automaton, it holds:…”

Section: Can Expressions and Automata Code For Each Other?mentioning

confidence: 99%