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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11047-010-9208-y / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5933600 / rank
 
Normal rank
Property / zbMATH Keywords
 
insertion-deletion systems
Property / zbMATH Keywords: insertion-deletion systems / rank
 
Normal rank
Property / zbMATH Keywords
 
P systems
Property / zbMATH Keywords: P systems / rank
 
Normal rank
Property / zbMATH Keywords
 
decidability
Property / zbMATH Keywords: decidability / rank
 
Normal rank
Property / zbMATH Keywords
 
universality
Property / zbMATH Keywords: universality / rank
 
Normal rank
Property / zbMATH Keywords
 
computational completeness
Property / zbMATH Keywords: computational completeness / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11047-010-9208-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994351002 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S11047-010-9208-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:24, 9 December 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