Computing the relative entropy between regular tree languages (Q293468): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of Reversible Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate computation of the relative entropy between stochastic regular grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning deterministic regular grammars from stochastic samples in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative entropy between Markov transition rate matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inference of tree languages from finite samples: An algebraic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning context-free grammars from structural data in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure of relative entropy between individual sequences with application to universal classification / rank
 
Normal rank

Latest revision as of 03:39, 12 July 2024

scientific article
Language Label Description Also known as
English
Computing the relative entropy between regular tree languages
scientific article

    Statements

    Identifiers