Abstract
We consider weighted finite transition systems with weights from naturally ordered semirings. Such semirings comprise distributive lattices as well as the natural numbers with ordinary addition and multiplication, and the max -plus-semiring. For these systems we explore the concepts of covering and cascade product. We show a cascade decomposition result for such weighted finite transition systems using special partitions of the state set of the system. This extends a classical result of automata theory to the weighted setting.
This research was partially supported by the DAAD-Serbia project “Weighted Automata over Semirings and Lattices”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Béal, M.-P., Lombardy, S., Sakarovitch, J.: On the equivalence of ℤ-automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 397–409. Springer, Heidelberg (2005)
Dömösi, P., Nehaniv, C.L.: Algebraic Theory of Automata Networks. In: SIAM Monographs on Discrete Mathematics and Applications, vol. 11. Society for Industrial and Applied Mathematics, Philadelphia (2004)
Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2009)
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, London (1974)
Holcombe, W.M.L.: Algebraic Automata Theory. Cambridge University Press, Cambridge (1982)
Kleene, S.: Representations of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 3–42. Princeton University Press, Princeton (1956)
Krohn, K., Rhodes, J.L.: Algebraic theory of machines, I. Prime decomposition theorem for finite semigroups and machines. Trans. Amer. Math. Soc. 116, 450–464 (1965)
Mordeson, J.N., Malik, D.S.: Fuzzy Automata and Languages – Theory and Applications. Computational Mathematics Series. Chapman & Hall, CRC (2002)
Rhodes, J.L., Steinberg, B.: The q-Theory of Finite Semigroups. Springer, Heidelberg (2008)
Schützenberger, M.: On the definition of a family of automata. Information and Control 4, 245–270 (1961)
Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkäuser, Basel (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Droste, M., Meinecke, I., Šešelja, B., Tepavčević, A. (2011). A Cascade Decomposition of Weighted Finite Transition Systems. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)