Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2003: Developments in Language Theory pp 373–385Cite as

Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2710))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Allauzen and M. Mohri. Efficient algorithms for testing the twins property. Journal of Automata, Languages and Combinatorics, 2003. (To appear).

    Google Scholar 

  2. M.-P. Béal, O. Carton, C. Prieur, and J. Sakarovitch. Squaring transducers: An efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci., 292:45–63, 2003.

    Article  MATH  Google Scholar 

  3. J. Berstel. Transductions and context-free languages. B. G. Teubner, 1979.

    Google Scholar 

  4. J. Berstel and C. Reutenauer. Rational Series and their Languages. Springer Verlag, 1988.

    Google Scholar 

  5. M. Brilman and J.M. Vincent. Dynamics of synchronized parallel systems. Stochastic Models, 13(3):605–619, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  6. A.L. Buchsbaum, R. Giancarlo, and J.R. Westbrook. On the determinization of weighted finite automata. SIAM J. Comput., 30(5):1502–1531, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. Choffrut. Une caractérisation des fonctions séquentielles et des fonctions sousséquentielles en tant que relations rationnelles. Theor. Comput. Sci., 5:325–337, 1977.

    Article  MathSciNet  Google Scholar 

  8. C. Choffrut. Contribution à l’étude de quelques familles remarquables de fonctions rationnelles. Thèse d’état, Univ. Paris VII, 1978.

    Google Scholar 

  9. S. Eilenberg. Automata, languages and machines, vol. A. Academic Press, 1974.

    Google Scholar 

  10. S. Gaubert. Performance evaluation of (max,+) automata. IEEE Trans. Aut. Cont., 40(12):2014–2025, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  11. S. Gaubert and J. Mairesse. Task resource models and (max,+) automata. In J. Gunawardena, editor, Idempotency, volume 11, pages 133–144. Cambridge University Press, 1998.

    Google Scholar 

  12. S. Gaubert and J. Mairesse. Modeling and analysis of timed Petri nets using heaps of pieces. IEEE Trans. Aut. Cont., 44(4):683–698, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  13. K. Hashigushi. Algorithms for determining relative star height and star height. Inf. Comput., 78(2):124–169, 1988.

    Article  Google Scholar 

  14. K. Hashigushi, K. Ishiguro, and S. Jimbo. Decidability of the equivalence problem for finitely ambiguous finance automata. Int. J. Algebra Comput., 12(3):445–461, 2002.

    Article  Google Scholar 

  15. D. Krob. The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. J. Algebra Comput., 4(3):405–425, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  16. D. Krob and A. Bonnier-Rigny. A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring. Theor. Comput. Sci., 134:27–50, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  17. W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 5 of EATCS. Springer-Verlag, 1986.

    Google Scholar 

  18. M. Mohri. Finite-state transducers in language and speech processing. Comput. Linguist., 23(2):269–311, 1997.

    MathSciNet  Google Scholar 

  19. P. Moller. Théorie algébrique des systémes à événements discrets. PhD thesis, École des Mines de Paris, 1988.

    Google Scholar 

  20. J. Sakarovitch. A construction in finite automata that has remained hidden. Theor. Comput. Sci., 204:205–231, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  21. M.-P. Schützenberger. On the definition of a family of automata. Information and Control, 4(2–3):245–270, 1961.

    Article  MATH  MathSciNet  Google Scholar 

  22. M.-P. Schützenberger. Sur les relations rationnelles entre monoïdes libres. Theor. Comput. Sci., 3:243–259, 1976.

    Article  Google Scholar 

  23. I. Simon. Recognizable sets with multiplicities in the tropical semiring. In Mathematical Foundations of Computer Science, Proc. 13th Symp., number 324 in LNCS, pages 107–120, 1988.

    Google Scholar 

  24. G.X. Viennot. Heaps of pieces, I: Basic definitions and combinatorial lemmas. In Labelle and Leroux, editors, Combinatoire Énumérative, number 1234 in Lect. Notes in Math., pages 321–350. Springer, 1986.

    Google Scholar 

  25. A. Weber. Finite-valued distance automata. Theor. Comput. Sci., 134:225–251, 1994.

    Article  MATH  Google Scholar 

  26. A. Weber and R. Klemm. Economy of description for single-valued transducers. Information and Computation, 118(2):327–340, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  27. A. Weber and H. Seidl. On the degree of ambiguity of finite automata. Theor. Comput. Sci., 88(2):325–349, 1991.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, CNRS (umr 7089), Université Paris 7, 2, place Jussieu, 75251, Paris Cedex 5, France

    Ines Klimann, Sylvain Lombardy, Jean Mairesse & Christophe Prieur

Authors
  1. Ines Klimann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sylvain Lombardy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean Mairesse
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christophe Prieur
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klimann, I., Lombardy, S., Mairesse, J., Prieur, C. (2003). Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

  • Online ISBN: 978-3-540-45007-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation