View source for Publications/demaille.16.ictac

{{Publication
| published = true
| date = 2016-07-06
| authors = Akim Demaille
| title = Derived-term Automata for Extended Weighted Rational Expressions
| booktitle = Proceedings of the Thirteenth International Colloquium on Theoretical Aspects of Computing (ICTAC)
| publisher = Springer
| series = Lecture Notes in Computer Science
| address = Taipei, Taiwan
| 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.
| lrdeprojects = Vcsn
| lrdepaper = http://www.lrde.epita.fr/dload/papers/demaille.16.ictac.pdf
| lrdereport = http://www.lrde.epita.fr/dload/papers/demaille.16.ictac.report.pdf
| lrdenewsdate = 2016-07-06
| note = accepted
| type = inproceedings
| id = demaille.16.ictac
| bibtex = 
@InProceedings<nowiki>{</nowiki>	  demaille.16.ictac,
  author	= <nowiki>{</nowiki>Akim Demaille<nowiki>}</nowiki>,
  title		= <nowiki>{</nowiki>Derived-term Automata for Extended Weighted Rational
		  Expressions<nowiki>}</nowiki>,
  booktitle	= <nowiki>{</nowiki>Proceedings of the Thirteenth International Colloquium on
		  Theoretical Aspects of Computing (ICTAC)<nowiki>}</nowiki>,
  year		= 2016,
  publisher	= <nowiki>{</nowiki>Springer<nowiki>}</nowiki>,
  series	= <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>,
  address	= <nowiki>{</nowiki>Taipei, Taiwan<nowiki>}</nowiki>,
  month		= oct,
  abstract	= <nowiki>{</nowiki>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.<nowiki>}</nowiki>,
  note		= <nowiki>{</nowiki>accepted<nowiki>}</nowiki>
<nowiki>}</nowiki>

}}