Soliton automata

DOI10.1016/0022-0000(90)90010-IzbMath0694.68041OpenAlexW2912522143MaRDI QIDQ909470

Juergen Dassow, Helmut Jürgensen

Publication date: 1990

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(90)90010-i

zbMATH Keywords

simulationswitchingsoliton automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

Structuring the elementary components of graphs having a perfect internal matching. ⋮ Deterministic soliton automata with at most one cycle ⋮ Peptide Computers ⋮ Tutte type theorems for graphs having a perfect internal matching ⋮ Soliton Automata with Multiple Waves ⋮ Unnamed Item ⋮ Soliton automata ⋮ Automata represented by products of soliton automata ⋮ A structure theorem for maximum internal matchings in graphs ⋮ Soliton automata with constant external edges ⋮ The monoidal structure of Turing machines ⋮ Deterministic soliton automata with a single exterior node

Cites Work

• Soliton automata
• Deterministic soliton automata with at most one cycle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Soliton automata