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

E-ISSN： 1290-385x|42|3|553-581

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.42, Iss.3, 2008-06, pp. : 553-581

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On hyperspaces of max-plus and max-min convex sets

ESAIM: Proceedings and surveys, Vol. 57, Iss. issue, 2017-10 ,pp. : 097-097

Edp Sciences

Access to resources Recommend Favorite

Hopcroft's algorithm and tree-like automata

By Castiglione G. Restivo A. Sciortino M.

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 1, 2011-03 ,pp. : 59-75

Edp Sciences

Access to resources Recommend Favorite

Series which are both max-plus and min-plus rational are unambiguous

By Lombardy Sylvain Mairesse Jean

RAIRO - Theoretical Informatics and Applications, Vol. 40, Iss. 1, 2010-03 ,pp. : 1-14

Edp Sciences

Access to resources Recommend Favorite

An algorithm for multiparametric min max 0-1-integer programmingproblems relative to the objective function

By Quintero José Luis Crema Alejandro

RAIRO - Operations Research, Vol. 39, Iss. 4, 2006-04 ,pp. : 243-252

Edp Sciences

Access to resources Recommend Favorite

A polynomial algorithm for minDSC on a subclass of series Parallel graphs

By Achouri Salim Bossart Timothée Munier-Kordon Alix

RAIRO - Operations Research, Vol. 43, Iss. 2, 2009-04 ,pp. : 145-156

Edp Sciences

Access to resources Recommend Favorite