Hardware Reference
In-Depth Information
tac-toe is used to illustrate how a game can be modeled BLIF-MV and solved using
BALM. The techniques described in this chapter generally apply to finite games
where after a finite number of moves, the game is over. However, if a strictly winning
strategy is desired, it might be necessary to model the game with
!
-automata (as
discussed in Chap. 18).
Chapter 18 illustrates how, in certain situations, the theory and implementation
developed for finite-word automata can be applied to infinite-word automata.
Although the theory of language solving can be extended formally (as discussed in
Chap. 4 in Part I), the complexity of solving becomes doubly exponential in general.
In this chapter, a restricted form of
-language solving is discussed, which almost
fits into the finite-word implementation, as available in BALM, except for a small
modification of the derived result at the end.
!
Search WWH ::
Custom Search