Deterministic soliton automata with a single exterior node

DOI10.1016/0304-3975(91)90164-WzbMath0734.68065WikidataQ127798208 ScholiaQ127798208MaRDI QIDQ811132

Juergen Dassow, Helmut Jürgensen

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

permutation groupssoliton graphsoliton automatontransition monoids

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items

Structuring the elementary components of graphs having a perfect internal matching. ⋮ Deterministic soliton automata with at most one cycle ⋮ Soliton Automata with Multiple Waves ⋮ Unnamed Item ⋮ Soliton automata with constant external edges ⋮ SOLITON AUTOMATA BASED ON TREES

Cites Work

• Soliton automata
• Automata represented by products of soliton automata
• Deterministic soliton automata with at most one cycle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item