Boundedness testing for unambiguous context-free grammars (Q594604): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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(83)90037-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005135112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambiguity in context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating null rules in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence, containment, and covering problems for the regular and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325061 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:12, 14 June 2024

scientific article
Language Label Description Also known as
English
Boundedness testing for unambiguous context-free grammars
scientific article

    Statements

    Boundedness testing for unambiguous context-free grammars (English)
    0 references
    0 references
    1983
    0 references
    bounded language
    0 references
    left Szilard language
    0 references
    polynomial time algorithm
    0 references
    unambiguous context-free grammars
    0 references

    Identifiers