VOLUME 12 2007 NUMBERS 1–2
Graph Decomposition and Descriptional Complexity of Soliton Automata
Miklós Krész
Pages 237–263



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2007-237,
  author  = {Mik{\'{o}}s Kr{\'{e}}sz},
  title   = {Graph Decomposition and Descriptional Complexity of Soliton Automata},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {12},
  number  = {1--2},
  pages   = {237--263},
  year    = {2007},
  url     = {https://doi.org/10.25596/jalc-2007-237},
  doi     = {10.25596/jalc-2007-237}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: matchings in graphs, graph decomposition, molecular computing, soliton automata, automata products
DOI: 10.25596/jalc-2007-237