Elementary decomposition of soliton automata (Q2714409)
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 1604334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Elementary decomposition of soliton automata |
scientific article; zbMATH DE number 1604334 |
Statements
22 June 2005
0 references
soliton automata
0 references
Elementary decomposition of soliton automata (English)
0 references
Soliton automata model some switching devices that can be used in molecular computing. Soliton automata are built on top of soliton graphs that represent hydrocarbon molecular-chain structures and this accounts for the complex structure of these devices. The present paper establishes a decomposition of soliton automata into elementary ones, i.e., into soliton automata whose underlying graphs have a relatively simple form. This result allows for the complete characterization of some types of soliton automata.
0 references
0.8492864370346069
0 references
0.845693051815033
0 references
0.841016411781311
0 references