On Determinism and Unambiguity of Weighted Two-Way Automata

DOI10.1142/S0129054115400158zbMath1338.68142arXiv1405.5602MaRDI QIDQ2800415

Vincent Carnino, Sylvain Lombardy

Publication date: 15 April 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

weighted automatadeterminizationunambiguitytwo-way automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (2)

Two-way representations and weighted automata ⋮ From Hadamard expressions to weighted rotating automata and back

Cites Work

• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• THE VALIDITY OF WEIGHTED AUTOMATA

This page was built for publication: On Determinism and Unambiguity of Weighted Two-Way Automata