Computational power of insertion-deletion (P) systems with rules of size two (Q553921): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: P systems with minimal insertion and deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contextual insertions/deletions and computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on Insertion-Deletion Systems with One-Sided Contexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of recursively enumerable languages by means of insertion grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion-Deletion Systems with One-Sided Contexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517111 / rank
 
Normal rank

Revision as of 08:03, 4 July 2024

scientific article
Language Label Description Also known as
English
Computational power of insertion-deletion (P) systems with rules of size two
scientific article

    Statements

    Computational power of insertion-deletion (P) systems with rules of size two (English)
    0 references
    0 references
    0 references
    28 July 2011
    0 references
    insertion-deletion systems
    0 references
    P systems
    0 references
    decidability
    0 references
    universality
    0 references
    computational completeness
    0 references

    Identifiers