Types of trusted information that make DFA identification with correction queries feasible (Q3073646)
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: Types of trusted information that make DFA identification with correction queries feasible |
scientific article; zbMATH DE number 5850601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Types of trusted information that make DFA identification with correction queries feasible |
scientific article; zbMATH DE number 5850601 |
Statements
Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (English)
0 references
11 February 2011
0 references
deterministic finite automaton
0 references
correction query
0 references
injectivity degree
0 references
0.7789768576622009
0 references
0.7608168125152588
0 references
0.7429437041282654
0 references
0.7407041192054749
0 references
0.7284868955612183
0 references
