PC grammar systems with five context-free components generate all recursively enumerable languages. (Q1874424): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational completeness of context-free parallel communicating grammar systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel communicating grammar systems with bounded resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of context-free PC grammar systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3982094 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00852-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092508863 / rank
 
Normal rank

Latest revision as of 10:13, 30 July 2024

scientific article
Language Label Description Also known as
English
PC grammar systems with five context-free components generate all recursively enumerable languages.
scientific article

    Statements

    PC grammar systems with five context-free components generate all recursively enumerable languages. (English)
    0 references
    0 references
    0 references
    25 May 2003
    0 references
    Parallel communicating grammar systems
    0 references
    Descriptional complexity
    0 references
    Recursively enumerable languages
    0 references

    Identifiers