Graph decomposition and descriptional complexity of soliton automata

Authors:
Milkós Krész
Affiliations:
Department of Computer Science, University of Szeged, Juhdsz Gyula Faculty of Education, Hungary
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 11
Cited 1

Products of automata

Products of automata
Soliton automata

Journal of Computer and System Sciences
Automata represented by products of soliton automata

Theoretical Computer Science
Deterministic soliton automata with a single exterior node

Theoretical Computer Science
A structure theorem for maximum internal matchings in graphs

Information Processing Letters
Deterministic soliton automata with at most one cycle

Journal of Computer and System Sciences
Elementary decomposition of soliton automata

Acta Cybernetica
Structuring the elementary components of graphs having a perfect internal matching

Theoretical Computer Science
Tutte type theorems for graphs having a perfect internal matching

Information Processing Letters
Matching Theory (North-Holland mathematics studies)

Matching Theory (North-Holland mathematics studies)
Simulation of soliton circuits

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Soliton automata with constant external edges

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.