The hardest linear conjunctive language (Q1007613): 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: On real-time cellular automata and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition and parsing algorithm for arbitrary conjunctive grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closure properties of linear conjunctive languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742751 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:47, 29 June 2024

scientific article
Language Label Description Also known as
English
The hardest linear conjunctive language
scientific article

    Statements

    The hardest linear conjunctive language (English)
    0 references
    0 references
    23 March 2009
    0 references
    computational complexity
    0 references
    formal languages
    0 references
    conjunctive grammars
    0 references
    Trellis automata
    0 references

    Identifiers