Deciding the sequentiality of a finitely ambiguous max-plus automaton

Authors:
Ines Klimann;Sylvain Lombardy;Jean Mairesse;Christophe Prieur
Affiliations:
LIAFA, CNRS, UMR, Université Paris 7, Paris Cedex 5, France;LIAFA, CNRS, UMR, Université Paris 7, Paris Cedex 5, France;LIAFA, CNRS, UMR, Université Paris 7, Paris Cedex 5, France;LIAFA, CNRS, UMR, Université Paris 7, Paris Cedex 5, France
Venue:
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Year:
2003

Citing 14
Cited 0

Semirings, automata, languages

Semirings, automata, languages
Algorithms for determining relative star height and star height

Information and Computation
Rational series and their languages

Rational series and their languages
On the degree of ambiguity of finite automata

Theoretical Computer Science
A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring

Selected papers of the second international colloquium on Words, languages and combinatorics
Finite-valued distance automata

Selected papers of the second international colloquium on Words, languages and combinatorics
Economy of description for single-valued transducers

Information and Computation
A construction on finite automata that has remained hidden

Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Automata, Languages, and Machines

Automata, Languages, and Machines
On the Determinization of Weighted Finite Automata

SIAM Journal on Computing
Squaring transducers: an efficient procedure for deciding functionality and sequentiality

Theoretical Computer Science
Recognizable Sets with Multiplicities in the Tropical Semiring

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Efficient algorithms for testing the twins property

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Finite-state transducers in language and speech processing

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is sequential. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.