Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton

Authors:
Ines Klimann;Sylvain Lombardy;Jean Mairesse;Christophe Prieur
Affiliations:
LIAFA, CNRS (UMR 7089), Université Paris 7 2, place Jussieu, 75251 Paris Cedex 5, France;LIAFA, CNRS (UMR 7089), Université Paris 7 2, place Jussieu, 75251 Paris Cedex 5, France;LIAFA, CNRS (UMR 7089), Université Paris 7 2, place Jussieu, 75251 Paris Cedex 5, France;LIAFA, CNRS (UMR 7089), Université Paris 7 2, place Jussieu, 75251 Paris Cedex 5, France
Venue:
Theoretical Computer Science - Developments in language theory
Year:
2004

Citing 14
Cited 9

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

Sequential?

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
How to Tackle Integer Weighted Automata Positivity

RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Component Simulation-based Substitutivity Managing QoS Aspects

Electronic Notes in Theoretical Computer Science (ENTCS)
Component simulation-based substitutivity managing QoS and composition issues

Science of Computer Programming
Conjugacy and equivalence of weighted automata and functional transducers

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring

Theoretical Computer Science
Strong lexicalization of tree adjoining grammars

ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Automatic vandalism detection in wikipedia with active associative classification

TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
Quantitative Monadic Second-Order Logic

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

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 whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. Furthermore, the proof is constructive. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.