Abstract
Weighted automata, especially min-plus automata that operate over the tropical semiring, have both a beautiful theory and important practical applications. In particular, if one could find a sequential or finitely sequential equivalent to a given (or learned) min-plus automaton, one could increase performance in several applications. But this question has long remained open even as a decision problem. We show that existence of a finitely sequential equivalent for a given finitely ambiguous min-plus automaton is decidable.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported by NCN grant DEC-2011/01/D/ST6/07164, 2011-2015. The work was done in main part during the author visit at LIAFA laboratory Univeristy Paris Diderot, and in cooperation with the European Union’s Seventh Framework Programme (FP7/2007-2013) grant agreement 259454. The visit at LIAFA was sponsored by European Science Foundation, within the project GAMES.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kirsten, D., Lombardy, S.: Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata. In: Albers, S., Marion, J.Y. (eds.) STACS. LIPIcs, vol. 3, pp. 589–600. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)
Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269–311 (1997)
Klimann, I., Lombardy, S., Mairesse, J., Prieur, C.: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theor. Comput. Sci. 327(3), 349–373 (2004)
Kirsten, D.: A burnside approach to the termination of mohri’s algorithm for polynomially ambiguous min-plus-automata. ITA 42(3), 553–581 (2008)
Lombardy, S., Sakarovitch, J.: Sequential? Theor. Comput. Sci. 356(1-2), 224–244 (2006)
Choffrut, C.: Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles. Theor. Comput. Sci. 5(3), 325–337 (1977)
Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. Journal of Automata, Languages and Combinatorics 8(2), 117–144 (2003)
Kirsten, D.: Decidability, undecidability, and pspace-completeness of the twins property in the tropical semiring. Theor. Comput. Sci. 420, 56–63 (2012)
Sakarovitch, J., de Souza, R.: On the decomposition of k-valued rational relations. In: Albers, S., Weil, P. (eds.) STACS. LIPIcs, vol. 1, pp. 621–632. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)
Hashiguchi, K., Ishiguro, K., Jimbo, S.: Decidability of the equivalence problem for finitely ambiguous finance automata. IJAC 12(3), 445 (2002)
Haumbold, N.: The similarity and equivalence problem for finitely ambiguous automata over tropical semiring. Master Thesis under supervision of Daniel Kirsten, TU Dresden Farichtung Mathematic Institute fur Algebra (2006)
Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 101–112. Springer, Heidelberg (1992)
Weber, A.: Decomposing a k-valued transducer into k unambiguous ones. ITA 30(5), 379–413 (1996)
Bala, S., Koniński, A.: Unambiguous automata denoting finitely sequential functions. In: Dediu, A.-H., Martín-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 104–115. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bala, S. (2013). Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?. In: Chatterjee, K., Sgall, J. (eds) Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science, vol 8087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-40313-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40312-5
Online ISBN: 978-3-642-40313-2
eBook Packages: Computer ScienceComputer Science (R0)