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

Daniel Kirsten

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata”

One implementation of PL prover algorithm

Tatjana Timotijević (2001)

Kragujevac Journal of Mathematics

Similarity:

A syntax directed translation algorithm for ALGOL-like languages

Jan Vinař (1966)

Kybernetika

Similarity:

Commutative images of rational languages and the abelian kernel of a monoid

Manuel Delgado (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Natural algorithms to compute rational expressions for recognizable languages, even those which work well in practice, may produce very long expressions. So, aiming towards the computation of the commutative image of a recognizable language, one should avoid passing through an expression produced this way. We modify here one of those algorithms in order to compute directly a semilinear expression for the commutative image of a recognizable language. We also give a second modification...