|Title:||A cascade decomposition of weighted finite transition systems||Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||Volume:||6795 LNCS||First page:||472||Last page:||473||Conference:||15th International Conference on Developments in Language Theory, DLT 2011; Milan; Italy; 19 July 2011 through 22 July 2011||Issue Date:||29-Jul-2011||Rank:||M33||ISBN:||978-3-642-22320-4||ISSN:||0302-9743||DOI:||10.1007/978-3-642-22321-1_43||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.
|Publisher:||Springer Link||Project:||Advanced analytical, numerical and analysis methods of applied fluid mechanics and complex systems
DAAD-Serbia project “Weighted Automata over Semirings and Lattices”
Show full item record
checked on Dec 5, 2022
checked on Dec 9, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.