On Determinism and Unambiguity of Weighted Two-way Automata
Formal Languages and Automata Theory
2014-05-23 v1
Abstract
In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism. Yet, we prove that the conversion of an unambiguous weighted one-way automaton into a two-way automaton leads to a deterministic two-way automaton. As a consequence, we prove that unambiguous weighted two-way automata are equivalent to deterministic weighted two-way automata in commutative semirings.
Keywords
Cite
@article{arxiv.1405.5602,
title = {On Determinism and Unambiguity of Weighted Two-way Automata},
author = {Vincent Carnino and Sylvain Lombardy},
journal= {arXiv preprint arXiv:1405.5602},
year = {2014}
}
Comments
In Proceedings AFL 2014, arXiv:1405.5272