L<sub>p</sub> DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA (Q3503091): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Biological Sequence Analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probabilistic automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The consensus string problem and the complexity of comparing hidden Markov models. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some inequalities for information divergence and related measures of discrimination / rank | |||
Normal rank | |||
Latest revision as of 10:25, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | L<sub>p</sub> DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA |
scientific article |
Statements
L<sub>p</sub> DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA (English)
0 references
20 May 2008
0 references
