Graph Decomposition and Descriptional Complexity of Soliton Automata
Miklós Krész · Universitätsbibliothek Gießen · 2007
An efficient method based on the elementary decomposition of soliton graphs is worked out for soliton automata by which their descriptional complexity is reduced to automata defined by elementary graphs.