Regular expressions into finite automata

Brüggemann-Klein, Anne

doi:10.1016/0304-3975(93)90287-4

Cited by 216 publications

(135 citation statements)

References 4 publications

Supporting

Mentioning

133

Contrasting

Order By: Relevance

“…In the direct conversion method [1,2], REs can be converted into DFAs . Given RE r over an alphabet Σ with length n. Let m depicts the number of instances of symbols from Σ in r. Table 1 narrates the output and number of states generated by Thompson ′ s construction, Glushkov automata [17] and the direct conversion method.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Novel Algorithm for the Conversion of Parallel Regular Expressions to Non-deterministic Finite Automata

Kumar¹,

Verma²

2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Abstract:The aim of the paper is to concoct a novel algorithm for the metamorphosis of parallel regular expressions to ε-free nondeterministic finite automata. For a given parallel regular expression r, let m be the number of symbols that occur in r and let C denote the number of concatenation operators in r. In the worst case, 2 m+1 states are required for the construction of the non-deterministic finite automaton using the novel algorithm. In the earlier existing approaches, the number of states of the non-deterministic finite automaton in the worst case is equal to 2 2|r|−3C .

show abstract

Section: Related Workmentioning

confidence: 99%

“…In the direct conversion [1,2] of RE to DFA, a syntax tree is constructed conforming to the augmented RE r# such that all operators act as the internal nodes and symbols act as the leaf node of the syntax tree. Positions are assigned to the symbols of the RE increasing from left to right.…”

Section: Proposed Algorithmmentioning

confidence: 99%

A Novel Algorithm for the Conversion of Parallel Regular Expressions to Non-deterministic Finite Automata

Kumar¹,

Verma²

2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…Clearly, the number of states of the automaton A(E) is the litteral-length (E) of expression E. The time complexity is cubic in the length of E. It should be possible to get a quadratic algorithm by generalizing the notion of star normal form introduced in [9] for word languages or the algorithm presented in [1] for classical weighted expressions and automata.…”

Section: From Expressions To Automatamentioning

confidence: 99%

Adding Pebbles to Weighted Automata

Gastin

Monmege

2012

Implementation and Application of Automata

View full text Add to dashboard Cite

Abstract. We extend weighted automata and weighted rational expressions with 2-way moves and (reusable) pebbles. We show with examples from natural language modeling and quantitative model-checking that weighted expressions and automata with pebbles are more expressive and allow much more natural and intuitive specifications than classical ones. We extend Kleene-Schützenberger theorem showing that weighted expressions and automata with pebbles have the same expressive power. We focus on an efficient translation from expressions to automata. We also prove that the evaluation problem for weighted automata can be done very efficiently if the number of (reusable) pebbles is low.

show abstract

“…If the actual efficiency of the computation depends unpon the implementation, it is known that the construction of S E is of quadratic complexity (with respect to (E)) ( [22]). …”

Section: An Experimental Point Of Viewmentioning

confidence: 99%

“…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%