
Accession Number : AD0749551
Title : Tolerant Automata and Variable Length Coding.
Descriptive Note : Doctoral thesis,
Corporate Author : UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES DEPT OF ELECTRICAL ENGINEERING
Personal Author(s) : Mansoori,Iraj Dara
Report Date : AUG 1972
Pagination or Media Count : 92
Abstract : Tolerant automata are finite state machines which, in due time, can recover their correct state after a change or transformation in the input sequence. A given finite state machine can tolerate, or be synchronized with respect to, a specific set of transformations depending on the machine. The synchronization is achieved by introduction of certain sequences in the input called universal synchronizers. Effective procedures exist for determining the set of tolerable transformations in the input sequence and the set of universal synchronizers, for any given finite state machine. Conversely, it is often possible to find all the finite state machines which can tolerate a given set of transformations. The question whether this can be done is, in general, undecidable. For individual cases it is usually possible to solve the problem. (Author)
Descriptors : (*ARTIFICIAL INTELLIGENCE, MATHEMATICAL LOGIC), SET THEORY, TRANSFORMATIONS(MATHEMATICS), AUTOMATA, PROBABILITY, CODING, GROUPS(MATHEMATICS), GRAPHICS, THEOREMS, THESES
Subject Categories : Statistics and Probability
Bionics
Distribution Statement : APPROVED FOR PUBLIC RELEASE