DocumentCode :
905459
Title :
Test for synchronizability of finite automata and variable length codes
Author :
Even, Shimon
Volume :
10
Issue :
3
fYear :
1964
fDate :
7/1/1964 12:00:00 AM
Firstpage :
185
Lastpage :
189
Abstract :
A finite automation is called synchronizable of 
th order if the knowledge of the last outputs suffices to determine the state of the automaton at one time during the last outputs (including the initial and the final states). In an analogous manner synchronizability of th order is defined for variable length codes. The paper describes a test for synchronizability on a more general model, the coding graphs, and shows that finite automata and variable length codes are special cases of it.
th order if the knowledge of the last outputs suffices to determine the state of the automaton at one time during the last outputs (including the initial and the final states). In an analogous manner synchronizability of th order is defined for variable length codes. The paper describes a test for synchronizability on a more general model, the coding graphs, and shows that finite automata and variable length codes are special cases of it.Keywords :
Automata; Synchronization; Variable-length coding (VLC); Automata; Automatic testing; Band pass filters; Extraterrestrial measurements; Gaussian noise; Information theory; Narrowband; Power engineering and energy; Power measurement; Signal to noise ratio;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1964.1053683
Filename :
1053683
Link To Document :
