Computing the relative entropy between regular tree languages (Q293468): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q45 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q32 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q42 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6590804 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
formal languages | |||
| Property / zbMATH Keywords: formal languages / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
automata theory | |||
| Property / zbMATH Keywords: automata theory / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
inductive learning | |||
| Property / zbMATH Keywords: inductive learning / rank | |||
Normal rank | |||
Revision as of 21:19, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the relative entropy between regular tree languages |
scientific article |
Statements
Computing the relative entropy between regular tree languages (English)
0 references
9 June 2016
0 references
formal languages
0 references
automata theory
0 references
inductive learning
0 references
