Data encoding algorithms in restructurable automata (Q1115614)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Data encoding algorithms in restructurable automata |
scientific article; zbMATH DE number 4087026
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Data encoding algorithms in restructurable automata |
scientific article; zbMATH DE number 4087026 |
Statements
Data encoding algorithms in restructurable automata (English)
0 references
1988
0 references
A restructurable automaton block diagram is proposed which combines high speed with an acceptable amount of hardware. Methods and algorithms are described for minimizing the combinational section of the automaton, different implementations of such automata are discussed, and their complexity is evaluated.
0 references
data encoding
0 references
restructurable automaton
0 references
block diagram
0 references
0.7149160504341125
0 references
0.7093135118484497
0 references
0.7002431750297546
0 references