论文信息 - Coalgebraic Semantics of Heavy-Weighted Automata

Coalgebraic Semantics of Heavy-Weighted Automata

htmlabstractWe study heavy-weighted automata, a generalization of weighted automata in which the weights of the transitions can be any formal power series. We define their semantics in three equivalent ways, and give some examples of how they can provide a more compact representation of certain power series than ordinary weighted automata.

Marcello M. Bonsangue | Jan J. M. M. Rutten | Marie Fortin

[1] Edward J. McCluskey,et al. Signal Flow Graph Techniques for Sequential Circuit State Diagrams , 1963, IEEE Trans. Electron. Comput..

[2] Alexandra Silva,et al. Generalizing determinization from automata to coalgebras , 2013, Log. Methods Comput. Sci..

[3] Jurriaan Rot,et al. Coalgebraic Bisimulation-Up-To , 2013, SOFSEM.

[4] Jan J. M. M. Rutten,et al. A coinductive calculus of streams , 2005, Mathematical Structures in Computer Science.

[5] M. Droste,et al. Handbook of Weighted Automata , 2009 .

[6] I. Petre,et al. Algebraic Systems and Pushdown Automata , 2009 .

[7] Jan J. M. M. Rutten. Coinductive Counting with Weighted Automata , 2003, J. Autom. Lang. Comb..

[8] Jan J. M. M. Rutten,et al. Behavioural differential equations: a coinductive calculus of streams, automata, and power series , 2003, Theor. Comput. Sci..

[9] Derick Wood,et al. Theory of computation , 1986 .

[10] Alexandra Silva,et al. A coalgebraic perspective on linear weighted automata , 2011, Inf. Comput..

[11] Derrick Wood,et al. Theory of Computation: A Primer , 1987 .

[12] Jacques Sakarovitch,et al. Elements of Automata Theory , 2009 .

[13] Marcello M. Bonsangue,et al. Defining Context-Free Power Series Coalgebraically , 2012, CMCS.

[14] José L. Ramírez,et al. Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs , 2013, Sci. Ann. Comput. Sci..