An Efficient Computation of the Equation K-automaton of a Regular K-expression

Champarnaud, Jean-Marc; Ouardi, Faissal; Ziadi, Djelloul

doi:10.3233/fi-2009-0001

Cited by 14 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different constructions of the derived-term automaton have been discovered [1,6]. They do not rely on derivatives at all.…”

Section: Makarevskii and Stotskayamentioning

confidence: 99%

Derived-Term Automata of Multitape Rational Expressions

Demaille

2016

Implementation and Application of Automata

View full text Add to dashboard Cite

We consider (weighted) rational expressions to denote series over Cartesian products of monoids. We define an operator | to build multitape expressions such as (a + | x + b + | y) * . We introduce expansions, which generalize the concept of derivative of a rational expression, but relieved from the need of a free monoid. We propose an algorithm based on expansions to build multitape automata from multitape expressions. Changes:2016-07-25 Appendix A.4 was added, showing how to compute the constant term and the derivatives for the tuple operator. Sect. 5 was adapted accordingly.

show abstract

“…Different constructions of the derived-term automaton have been discovered [1,6]. They do not rely on derivatives at all.…”

Section: Makarevskii and Stotskayamentioning

confidence: 99%

Derived-Term Automata of Multitape Rational Expressions

Demaille

2016

Implementation and Application of Automata

View full text Add to dashboard Cite

show abstract

“…For basic (weighted) expressions, completely different approaches build the derived-term automaton with a quadratic complexity [1,7]. However, the expansion-based algorithm features some unique properties.…”

Section: Related Workmentioning

confidence: 99%

Derived-Term Automata for Extended Weighted Rational Expressions

Demaille

2016

Theoretical Aspects of Computing – ICTAC 2016

View full text Add to dashboard Cite

We present an algorithm to build an automaton from a rational expression. This approach introduces support for extended weighted expressions. Inspired by derived-term based algorithms, its core relies on a different construct, rational expansions. We introduce an inductive algorithm to compute the expansion of an expression from which the automaton follows. This algorithm is independent of the size of the alphabet, and actually even supports infinite alphabets. It can easily be accommodated to generate deterministic (weighted) automata. These constructs are implemented in Vcsn, a free-software platform dedicated to weighted automata and rational expressions.

show abstract

“…As we have explained above,and in our own work [13], we have defined the derived terms by means of an induction rather than by the plain derivation. In [6], and in order to describe an efficient algorithm for the construction of the derived-term automaton, a link between the positions of the letters in the rational expression and the derived terms is made through in-between objects called c-continuations. This allows to define the derived-term automaton as a morphic image of the position automaton.…”

Section: Introductionmentioning

confidence: 99%