Исследование структуры множества линейных БПИ-автоматов над кольцом Zpk
For linear information-lossless automata over the ring Zp , we have established conditions and estimated cardinalities for sets of automata characterized via basic characteristics of automata theory (the transition graph is complete with a loop at each vertex, permutation and reduced automata, au...
Збережено в:
| Дата: | 2007 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Russian |
| Опубліковано: |
Видавничий дім "Академперіодика" НАН України
2007
|
| Теми: | |
| Онлайн доступ: | https://nasplib.isofts.kiev.ua/handle/123456789/3161 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Исследование структуры множества линейных БПИ-автоматов над кольцом Zpk / В.В. Скобелев // Доп. НАН України. — 2007. — № 10. — С. 44-49. — Бібліогр.: 11 назв. — рос. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | For linear information-lossless automata over the ring Zp , we have established conditions and
estimated cardinalities for sets of automata characterized via basic characteristics of automata
theory (the transition graph is complete with a loop at each vertex, permutation and reduced
automata, automata with twin states). For the investigated automata, a criterion of equivalence
is established, the problem of parametric identification is resolved, and the canonical presentati-
ons, in which all linear transformation are reduced to component-wise multiplication in the ring
and to the application of reversible matrices, are designed. |
|---|