Sie sind hier: Home :: Bereich NIMMT :: Mathematik

A. V. Babash

Periodically externally hereditary permutational automata

We suggest an algorithm which checks the following property of a given finite permutational automaton: for any periodic input sequence and any initial state the period of the corresponding output sequence is divided by the period of the input sequence. Estimates of the complexity of such algorithms are given.

Discrete Mathematics and Applications, Walter de Gruyter

Print ISSN: 0924-9266
Volume: 15, 11/2005
Seiten: 599 - 610

Zum Artikel (extern)

Alle verfügbaren Artikel dieser Zeitschrift anzeigen

 

Bereich NIMMT