Soliton automata with constant external edges

DOI10.1016/j.ic.2008.03.014zbMath1154.68071OpenAlexW2000671329MaRDI QIDQ948082

Miklós Krész

Publication date: 8 October 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.014

zbMATH Keywords

molecular electronicsautomata productmatchings in graphssoliton automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Logical Gates Implemented by Solitons at the Junctions Between One-Dimensional Lattices ⋮ Soliton Automata with Multiple Waves ⋮ Unnamed Item ⋮ The monoidal structure of Turing machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic soliton automata with a single exterior node
• Soliton automata
• Soliton-like behavior in automata
• Matching theory
• A structure theorem for maximum internal matchings in graphs
• Structuring the elementary components of graphs having a perfect internal matching.
• Deterministic soliton automata with at most one cycle
• Tutte type theorems for graphs having a perfect internal matching
• Flexible Matchings
• A Rule for Fast Computation and Analysis of Soliton Automata
• Implementation and Application of Automata