Investigations on the power of matrix insertion-deletion systems with small sizes (Q6061993): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/nc/FernauKR18, #quickstatements; #temporary_batch_1731483406851
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59864859 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11047-017-9656-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2773559383 / 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: Regulated RNA rewriting: Modelling RNA editing with guided insertion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonterminal complexity of programmed grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parikh Images of Matrix Ins-Del Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4964013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-controlled insertion-deletion systems generating language classes beyond linearity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3980380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms for phrase-structure grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Halting Problem of one State Turing Machines with <i>n</i>‐Dimensional Tape / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reachability problem for 5-dimensional vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Context and Semi-conditional Insertion-deletion Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems / 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: Small deterministic Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling DNA and RNA secondary structures using matrix insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of languages and linear-bounded automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite turns and the regular closure of linear context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3486871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-state 2-symbol Turing machines with periodic support produce regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Small Universal Turing Machines: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in formal languages and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Six nonterminals are enough for generating each r.e. language by a matrix grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-sided and two-sided context in formal grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata Studies. (AM-34) / 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 / cites work
 
Property / cites work: Recent developments on insertion-deletion systems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/nc/FernauKR18 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:31, 13 November 2024

scientific article; zbMATH DE number 7772430
Language Label Description Also known as
English
Investigations on the power of matrix insertion-deletion systems with small sizes
scientific article; zbMATH DE number 7772430

    Statements

    Investigations on the power of matrix insertion-deletion systems with small sizes (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2023
    0 references
    matrix ins-del systems
    0 references
    matrix control
    0 references
    descriptional complexity
    0 references
    computational completeness
    0 references
    metalinear languages
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers