SYNTHESIS PROBLEM FOR DETERMINISTIC CONTROLLED (k,m)-SHIFT-REGISTERS (Q3801078)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4068291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SYNTHESIS PROBLEM FOR DETERMINISTIC CONTROLLED (k,m)-SHIFT-REGISTERS |
scientific article; zbMATH DE number 4068291 |
Statements
SYNTHESIS PROBLEM FOR DETERMINISTIC CONTROLLED (k,m)-SHIFT-REGISTERS (English)
0 references
1987
0 references
controlled shift-registers
0 references
feedback functions
0 references
pseudoperiodic sequences
0 references
0.902567982673645
0 references
The aim of this paper is to solve the synthesis problem for a class of controlled shift-registers, briefly (k,m)-registers. Every such register can be defined by means of an indexed set \(\Phi =\{\phi_ 1,...,\phi_ m\}\) of feedback functions (every \(\phi_ i\) is a total function of \(A^ k\) into A) and a control \(\psi\) : \({\mathbb{N}}\to_{onto}\{1,...,m\}\) (\(\psi\) is a total recursive function). Let \({\mathcal E}^ 1\) denote the class of finite sets consisting of only pseudoperiodic sequences which are defined by means of their thresholds and the cycles. Let \(E\in {\mathcal E}^ 1\) and k, m be arbitrary (fixed) positive integers. The following problems will be considered: (1) we have to decide if there is a (k,m)-register generating E; (2) given a set \(\Phi =(\phi_ 1,...,\phi_ m\}\) we have to decide if there is a controlled (k,m)-register for which \(\Phi\) is the feedback function set and generating E; (3) given a periodic function \(\psi\) : \({\mathbb{N}}\to_{onto}\{1,...,m\}\) we have to decide if there is a (k,m)-register generating E for which \(\psi\) is a control. If an answer on the above problems is positive we have to construct a respective (k,m)-register generating E.
0 references