Efficient learning of typical finite automata from random walks (Q1373138)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1083947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient learning of typical finite automata from random walks |
scientific article; zbMATH DE number 1083947 |
Statements
Efficient learning of typical finite automata from random walks (English)
0 references
2 June 1998
0 references
learning deterministic finite automata
0 references
0 references
0 references
0.9158916
0 references
0.88297075
0 references
0.88233966
0 references
0.8811333
0 references
0.87791747
0 references
0.8773405
0 references
0.8741033
0 references
