PROBABILISTIC BEHAVIOUR/STRUCTURE TRANSFORMATIONS USING TRANSITIVE MOORE MODELS

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 consi...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of general systems 1980-12, Vol.6 (3), p.129-137
Main Author:	WITTEN, IAN H.
Format:	Article
Language:	eng
Subjects:	admissible models finite-memory models grammatical inference non-deterministic automata System identification
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	0308-1079 1563-5104