Self-assembling finite automata

DOI10.25596/JALC-2009-075MaRDI QIDQ5192991zbMATH OpenFDO

Authors Martin Kutrib, Andreas Klein

Publication date 10 August 2009

Full work available at URL https://doi.org/10.25596/JALC-2009-075

zbMATH Keywords

closure propertiescontext-free languagesself-assembly

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2089986
• Self-assembling pushdown automata
• scientific article; zbMATH DE number 1241087
• String assembling systems
• Hypergraph automata: a theoretical model for patterned self-assembly

Cited in

(10)

• Self-assembly of strings and languages
• Hypergraph automata: a theoretical model for patterned self-assembly
• scientific article; zbMATH DE number 1810490 (Why is no real title available?)
• scientific article; zbMATH DE number 1241087 (Why is no real title available?)
• scientific article; zbMATH DE number 2089986 (Why is no real title available?)
• SELF-SPECIFYING MACHINES
• scientific article; zbMATH DE number 3202044 (Why is no real title available?)
• Self-regulating finite automata
• Self-assembling pushdown automata
• Self-assembly of decidable sets

This page was built for publication: Self-assembling finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5192991)