ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS

DOI10.1142/S0129054113400224zbMath1286.68292MaRDI QIDQ5401560

Mehryar Mohri

Publication date: 10 March 2014

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

zbMATH Keywords

finite automatadisambiguationdeterminizationfinite-state transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ On the Disambiguation of Weighted Automata ⋮ A disambiguation algorithm for weighted automata

Cites Work

• Sur les rélations rationnelles entre monoides libres
• A construction on finite automata that has remained hidden
• GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS
• FINITELY SUBSEQUENTIAL TRANSDUCERS

This page was built for publication: ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS