SOLITON AUTOMATA BASED ON TREES
From MaRDI portal
Publication:3401473
DOI10.1142/S0129054107005303zbMath1183.68342OpenAlexW2032261263MaRDI QIDQ3401473
Pauline Kraak, Helmut Jürgensen
Publication date: 29 January 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054107005303
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Cites Work
- Deterministic soliton automata with a single exterior node
- Automata represented by products of soliton automata
- 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
- Countable Additivity and the de Finetti Lottery
- Unnamed Item
This page was built for publication: SOLITON AUTOMATA BASED ON TREES