Soliton circuits and network-based automata: review and perspectives

MaRDI QIDQ3018969zbMATH OpenFDO

Authors Miklós Bartha, Miklós Krész

Publication date 27 July 2011

zbMATH Keywords

matching theorypercolation processessoliton automatonstate transitionsmolecular switchingsoliton graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Deciding the deterministic property for soliton graphs
• Soliton automata with constant external edges
• Elementary decomposition of soliton automata
• scientific article; zbMATH DE number 4060730
• Soliton automata based on trees

Cited in

(5)

• Soliton Automata with Multiple Waves
• Peptide computers
• scientific article; zbMATH DE number 7584598 (Why is no real title available?)
• New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition
• Deciding the deterministic property for soliton graphs

This page was built for publication: Soliton circuits and network-based automata: review and perspectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3018969)