Derived-Term Automata for Extended Weighted Rational Expressions

From MaRDI portal
Revision as of 22:01, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3179410

DOI10.1007/978-3-319-46750-4_20zbMATH Open1482.68125arXiv1605.01530OpenAlexW2346998017MaRDI QIDQ3179410FDOQ3179410

Akim Demaille

Publication date: 21 December 2016

Published in: Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1605.01530





Cites Work


Cited In (1)

Uses Software






This page was built for publication: Derived-Term Automata for Extended Weighted Rational Expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179410)