DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS (Q3526537): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Intersection and union of regular languages and state complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Splicing semigroups of dominoes and DNA / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3862379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of normal form grammars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On two-way communication in cellular automata with a fixed number of cells / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing by splicing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regularity of splicing languages / rank | |||
Normal rank |
Revision as of 17:43, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS |
scientific article |
Statements
DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS (English)
0 references
25 September 2008
0 references
DNA computing
0 references
minimal nondeterministic finite automata
0 references
0 references