Constructing deterministic parity automata from positive and negative examples (Q6586928)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing deterministic parity automata from positive and negative examples |
scientific article; zbMATH DE number 7896324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing deterministic parity automata from positive and negative examples |
scientific article; zbMATH DE number 7896324 |
Statements
Constructing deterministic parity automata from positive and negative examples (English)
0 references
13 August 2024
0 references
deterministic parity automata
0 references
learning from examples
0 references
learning in the limit
0 references
family of right congruences
0 references
0 references
0 references
0 references
0.8382513523101807
0 references
0.7997525334358215
0 references
0.7729935050010681
0 references
0.759611964225769
0 references
