Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657923 | Theoretical Computer Science | 2005 | 37 Pages |
Abstract
We then define the derivative of such a rational expression as a linear combination of expressions called derived terms and we show that all derivatives of a given expression are generated by a finite set of derived terms, that yields a finite automaton with multiplicity whose behaviour is the series denoted by the expression. We also prove that this automaton is a quotient of the standard (or Glushkov) automaton of the expression. Finally, we propose and discuss some possible modifications to our definition of derivation.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sylvain Lombardy, Jacques Sakarovitch,