Parsimonious computational completeness (Q832917): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Complexity Landscape of the Domination Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three models for the description of language / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain formal properties of grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of Tag Systems with <i>P</i> = 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3811726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (generalized) Post correspondence problem with lists consisting of two words is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3125170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional transfer in regulated rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonterminal complexity of programmed grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3178873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517098 / 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: New nonterminal complexity results for semi-conditional grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved descriptional complexity results on generalized forbidding grammars / 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 computational completeness of graph-controlled insertion-deletion systems with binary sizes / 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: Computational completeness of simple semi-conditional insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigations on the power of matrix insertion-deletion systems with small sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4623037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional complexity of matrix simple semi-conditional grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matrix ins-del systems of small sum-norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On path-controlled insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of generalized forbidding insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized forbidding matrix grammars and their membrane computing perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal matrix insertion grammars with small size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for sequential grammars with control mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4964013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530001 / 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: Q3783607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA computing: Arrival of biological mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational power of insertion-deletion (P) systems with rules of size two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small deterministic Turing machines / 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: Context-free insertion-deletion systems / 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: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words / 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: Six nonterminals are enough for generating each r.e. language by a matrix grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of random context grammars: Semi-conditional grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Reductions of the General Combinatorial Decision Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comment on the paper 'Error detection in formal languages' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3953199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3051396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Make Arbitrary Grammars Look Like Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / 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: Recent developments on insertion-deletion systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal insertion grammars of size two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion-deletion systems with substitutions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion-deletion with substitutions. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3811725 / rank
 
Normal rank

Latest revision as of 12:06, 28 July 2024

scientific article
Language Label Description Also known as
English
Parsimonious computational completeness
scientific article

    Statements

    Parsimonious computational completeness (English)
    0 references
    0 references
    25 March 2022
    0 references
    normal forms
    0 references
    computational completeness
    0 references
    descriptional complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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