An algebraic characterization of semi-simple splicing

MaRDI QIDQ3409974zbMATH OpenFDO

Authors Rodica Ceterchi

Publication date 21 November 2006

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 1836435
• Simple splicing systems
• Regular splicing languages and subclasses
• Descriptional complexity of semi-simple splicing systems
• On the splicing operation

Cited in

(4)

• Conjugate word blending: formal model and experimental implementation by XPCR
• Splicing systems and the Chomsky hierarchy
• Descriptional Complexity of Semi-Simple Splicing Systems
• scientific article; zbMATH DE number 1836435 (Why is no real title available?)

This page was built for publication: An algebraic characterization of semi-simple splicing

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