Deterministic soliton automata with at most one cycle

DOI10.1016/0022-0000(93)90002-EzbMath0768.68097OpenAlexW1996889132MaRDI QIDQ2366276

Helmut Jürgensen, Juergen Dassow

Publication date: 29 June 1993

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(93)90002-e

zbMATH Keywords

treepathscyclessoliton graphsoliton automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (8)

Structuring the elementary components of graphs having a perfect internal matching. ⋮ Soliton Automata with Multiple Waves ⋮ Unnamed Item ⋮ Soliton automata ⋮ A structure theorem for maximum internal matchings in graphs ⋮ Soliton automata with constant external edges ⋮ SOLITON AUTOMATA BASED ON TREES ⋮ Deterministic soliton automata with a single exterior node

Cites Work

• Deterministic soliton automata with a single exterior node
• Soliton automata
• Automata represented by products of soliton automata
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deterministic soliton automata with at most one cycle