Weighted finite automata with output
Formal Languages and Automata Theory
2014-10-10 v1
Abstract
In this paper we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.
Keywords
Cite
@article{arxiv.1410.2415,
title = {Weighted finite automata with output},
author = {Jelena Ignjatović and Miroslav Ćirić and Zorana Jančić},
journal= {arXiv preprint arXiv:1410.2415},
year = {2014}
}
Comments
Preprint submitted to Soft Computing