Abstract
Existence criteria are found for synchronizing sequences of nonstationary linear automata in the space of generalized states. The properties of such sequences are studied. Synchronization methods are proposed for these automata with ordinary and weighed alphabets.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
