Abstract
The ATOM procedure for probabilistic behaviour/structure
transformation developed by Gaines 1,2 operates by enumerating and evaluating all
non-deterministic automata of a given size with respect to a given
behaviour. It is shown that a re-ordering of the model space can
usefully be effected by considering the class of transitive Moore
models, leading to a much more efficient method of finding simple
structure when it exists in the behaviour. Searching transitive Moore models is
tantamount to searching Mealy models in order of number of transitions
rather than state count, and results from a computer implementation are
presented.
Notes
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca
