A recognition and parsing algorithm for arbitrary conjunctive grammars. (Q1401337): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: An efficient context-free parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Context-Free Recognizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down parsing of conjunctive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:51, 6 June 2024

scientific article
Language Label Description Also known as
English
A recognition and parsing algorithm for arbitrary conjunctive grammars.
scientific article

    Statements

    A recognition and parsing algorithm for arbitrary conjunctive grammars. (English)
    0 references
    0 references
    17 August 2003
    0 references
    0 references
    Conjunctive grammars
    0 references
    Recognition
    0 references
    Parsing
    0 references
    Complexity
    0 references