Identification in the Limit of k,l-Substitutable Context-Free Languages (Q3528426): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inference of Reversible Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: NTS languages are deterministic and congruential / rank
 
Normal rank
Property / cites work
 
Property / cites work: PAC-Learning Unambiguous NTS Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of double Greibach normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic sets for polynomial grammatical inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning approximately regular languages with reversible languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning indexed families of recursive languages from positive data: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2714263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Equations and Normal Forms for Context-Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence and inclusion problems for NTS languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time identification of very simple grammars from positive data. / rank
 
Normal rank

Latest revision as of 18:21, 28 June 2024

scientific article
Language Label Description Also known as
English
Identification in the Limit of k,l-Substitutable Context-Free Languages
scientific article

    Statements

    Identification in the Limit of k,l-Substitutable Context-Free Languages (English)
    0 references
    0 references
    16 October 2008
    0 references

    Identifiers