Bidirectional string assembling systems

DOI10.1051/ita/2013048zbMath1366.68058OpenAlexW2064594808MaRDI QIDQ2877372

Matthias Wendlandt, Martin Kutrib

Publication date: 22 August 2014

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2014__48_1_39_0/

zbMATH Keywords

closure propertiesmulti-head finite automataconcatenation hierarchydouble-stranded sequencesstatelessstring assembling

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

String assembling systems: comparison to sticker systems and decidability