Handbook of Weighted Automata

¡ ¡
¡ Springer Science & Business Media
āχāĻŦ⧁āĻ•
608
āĻĒ⧃āĻˇā§āĻ āĻž
āĻŽā§‚āĻ˛ā§āϝāĻžāĻ‚āĻ•āύ āφ⧰⧁ āĻĒā§°ā§āϝāĻžāϞ⧋āϚāύāĻž āϏāĻ¤ā§āϝāĻžāĻĒāύ āϕ⧰āĻž āĻšā§‹ā§ąāĻž āύāĻžāχ  āĻ…āϧāĻŋāĻ• āϜāĻžāύāĻ•

āĻāχ āχāĻŦ⧁āĻ•āĻ–āύ⧰ āĻŦāĻŋāĻˇā§Ÿā§‡

The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the “resources” by “profit” and then be interested in the maximal profit realized, correspondingly, by a given word.

āĻāχ āχāĻŦ⧁āĻ•āĻ–āύāĻ• āĻŽā§‚āĻ˛ā§āϝāĻžāĻ‚āĻ•āύ āϕ⧰āĻ•

āφāĻŽāĻžāĻ• āφāĻĒā§‹āύāĻžā§° āĻŽāϤāĻžāĻŽāϤ āϜāύāĻžāĻ“āĻ•āĨ¤

āĻĒāĻĸāĻŧāĻžā§° āύāĻŋāĻ°ā§āĻĻ⧇āĻļāĻžā§ąāϞ⧀

āĻ¸ā§āĻŽāĻžā§°ā§āϟāĻĢ’āύ āφ⧰⧁ āĻŸā§‡āĻŦāϞ⧇āϟ
Android āφ⧰⧁ iPad/iPhoneā§° āĻŦāĻžāĻŦ⧇ Google Play Books āĻāĻĒāĻŸā§‹ āχāύāĻˇā§āϟāϞ āϕ⧰āĻ•āĨ¤ āχ āĻ¸ā§āĻŦāϝāĻŧāĻ‚āĻ•ā§āϰāĻŋāϝāĻŧāĻ­āĻžā§ąā§‡ āφāĻĒā§‹āύāĻžā§° āĻāĻ•āĻžāωāĻŖā§āϟ⧰ āϏ⧈āϤ⧇ āĻ›āĻŋāĻ‚āĻ• āĻšāϝāĻŧ āφ⧰⧁ āφāĻĒ⧁āύāĻŋ āϝ'āϤ⧇ āύāĻžāĻĨāĻžāĻ•āĻ• āϤ'āϤ⧇āχ āϕ⧋āύ⧋ āĻ…āĻĄāĻŋāĻ…'āĻŦ⧁āĻ• āĻ…āύāϞāĻžāχāύ āĻŦāĻž āĻ…āĻĢāϞāĻžāχāύāϤ āĻļ⧁āύāĻŋāĻŦāϞ⧈ āϏ⧁āĻŦāĻŋāϧāĻž āĻĻāĻŋāϝāĻŧ⧇āĨ¤
āϞ⧇āĻĒāϟāĻĒ āφ⧰⧁ āĻ•āĻŽā§āĻĒāĻŋāωāϟāĻžā§°
āφāĻĒ⧁āύāĻŋ āĻ•āĻŽā§āĻĒāĻŋāωāϟāĻžā§°ā§° ā§ąā§‡āĻŦ āĻŦā§āϰāĻžāωāϜāĻžā§° āĻŦā§āĻ¯ā§ąāĻšāĻžā§° āϕ⧰āĻŋ Google PlayāϤ āĻ•āĻŋāύāĻž āĻ…āĻĄāĻŋāĻ…'āĻŦ⧁āĻ•āϏāĻŽā§‚āĻš āĻļ⧁āύāĻŋāĻŦ āĻĒāĻžā§°ā§‡āĨ¤
āχ-ā§°ā§€āĻĄāĻžā§° āφ⧰⧁ āĻ…āĻ¨ā§āϝ āĻĄāĻŋāĻ­āĻžāχāϚ
Kobo eReadersā§° āĻĻ⧰⧇ āχ-āϚāĻŋ⧟āĻžāρāĻšā§€ā§° āĻĄāĻŋāĻ­āĻžāχāϚāϏāĻŽā§‚āĻšāϤ āĻĒā§āĻŋāĻŦāϞ⧈, āφāĻĒ⧁āύāĻŋ āĻāϟāĻž āĻĢāĻžāχāϞ āĻĄāĻžāωāύāĻ˛â€™āĻĄ āϕ⧰āĻŋ āϏ⧇āχāĻŸā§‹ āφāĻĒā§‹āύāĻžā§° āĻĄāĻŋāĻ­āĻžāχāϚāϞ⧈ āĻ¸ā§āĻĨāĻžāύāĻžāĻ¨ā§āϤ⧰āĻŖ āϕ⧰āĻŋāĻŦ āϞāĻžāĻ—āĻŋāĻŦāĨ¤ āϏāĻŽā§°ā§āĻĨāĻŋāϤ āχ-ā§°āĻŋāĻĄāĻžā§°āϞ⧈ āĻĢāĻžāχāϞāĻŸā§‹ āϕ⧇āύ⧇āĻ•ā§ˆ āĻ¸ā§āĻĨāĻžāύāĻžāĻ¨ā§āϤ⧰ āϕ⧰āĻŋāĻŦ āϜāĻžāύāĻŋāĻŦāϞ⧈ āϏāĻšāĻžāϝāĻŧ āϕ⧇āĻ¨ā§āĻĻā§ā§°āϤ āĻĨāĻ•āĻž āϏāĻŦāĻŋāĻļ⧇āώ āύāĻŋā§°ā§āĻĻ⧇āĻļāĻžā§ąāϞ⧀ āϚāĻžāĻ“āĻ•āĨ¤