Diophantine equations and splicing: A new demonstration of the generative capability of H systems

DOI10.1007/3-540-44992-2_4MaRDI QIDQ4529974zbMATH OpenFDO

Authors Pierluigi Frisco

Publication date 7 May 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2054/20540043

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Symbolic computation and algebraic computation (68W30)

Recommendations

• DNA computing based on splicing: Universality results
• Graph splicing systems
• scientific article; zbMATH DE number 992003
• scientific article; zbMATH DE number 1004368
• Explicitly constructing universal extended H systems

Cited in

(1)

• scientific article; zbMATH DE number 2013807 (Why is no real title available?)

This page was built for publication: Diophantine equations and splicing: A new demonstration of the generative capability of H systems

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