Difference between revisions of "Publications/demaille.16.ictac"
From LRDE
| Line 13: | Line 13: | ||
| lrdereport = http://www.lrde.epita.fr/dload/papers/demaille.16.ictac.report.pdf |
| lrdereport = http://www.lrde.epita.fr/dload/papers/demaille.16.ictac.report.pdf |
||
| lrdenewsdate = 2016-07-06 |
| lrdenewsdate = 2016-07-06 |
||
| − | | note = accepted |
||
| type = inproceedings |
| type = inproceedings |
||
| id = demaille.16.ictac |
| id = demaille.16.ictac |
||
| Line 39: | Line 38: | ||
deterministic (weighted) automata. These constructs are |
deterministic (weighted) automata. These constructs are |
||
implemented in Vcsn, a free-software platform dedicated to |
implemented in Vcsn, a free-software platform dedicated to |
||
| − | weighted automata and rational expressions.<nowiki>}</nowiki> |
+ | weighted automata and rational expressions.<nowiki>}</nowiki> |
| − | note = <nowiki>{</nowiki>accepted<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 14:17, 9 July 2017
- Authors
- Akim Demaille
- Where
- Proceedings of the Thirteenth International Colloquium on Theoretical Aspects of Computing (ICTAC)
- Place
- Taipei, Taiwan
- Type
- inproceedings
- Publisher
- Springer
- Projects
- Vcsn
- Date
- 2016-07-06
Abstract
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 constructrational 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.
Documents
Bibtex (lrde.bib)
@InProceedings{ demaille.16.ictac,
author = {Akim Demaille},
title = {Derived-term Automata for Extended Weighted Rational
Expressions},
booktitle = {Proceedings of the Thirteenth International Colloquium on
Theoretical Aspects of Computing (ICTAC)},
year = 2016,
publisher = {Springer},
series = {Lecture Notes in Computer Science},
address = {Taipei, Taiwan},
month = oct,
abstract = {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.}
}