A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata

From MaRDI portal
Publication:3526417

DOI10.1051/ita:2008017zbMath1155.68042OpenAlexW2000587532MaRDI QIDQ3526417

Daniel Kirsten

Publication date: 25 September 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92888




Related Items (20)



Cites Work


This page was built for publication: A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata