The membership question for ETOL-languages is polynomially complete (Q1219165): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(75)90027-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038287030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some families of languages related to developmental systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description of developmental languages using recurrence systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between ETOL and EDTOL languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programmed Grammars and Classes of Formal Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOL systems and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088273 / rank
 
Normal rank

Latest revision as of 16:07, 12 June 2024

scientific article
Language Label Description Also known as
English
The membership question for ETOL-languages is polynomially complete
scientific article

    Statements

    Identifiers