Loop-free compositions of certain finite automata

Abstract

The binary, periodic output sequence of a certain type of composite automaton is studied. Properties of the output sequence such as frequency of symbols and periods of subpatterns are expressed by properties of the component automata and their connections

Similar works

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.