Learning deterministic finite automata from interleaved strings (Q3588367)
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: Learning deterministic finite automata from interleaved strings |
scientific article; zbMATH DE number 5783856
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning deterministic finite automata from interleaved strings |
scientific article; zbMATH DE number 5783856 |
Statements
Learning Deterministic Finite Automata from Interleaved Strings (English)
0 references
10 September 2010
0 references
regular languages
0 references
interleaved languages
0 references
learning in the limit
0 references
workflow inference
0 references
0.7107950448989868
0 references
0.7105203866958618
0 references
0.7095435261726379
0 references
0.6599812507629395
0 references
