Learning unary output two-tape automata from multiplicity and equivalence queries (Q4247004)
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 1301788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning unary output two-tape automata from multiplicity and equivalence queries |
scientific article; zbMATH DE number 1301788 |
Statements
13 June 2000
0 references
nondeterministic finite automata
0 references
learning problem
0 references
0.8549853563308716
0 references
0.8333567976951599
0 references
0.7985260486602783
0 references
0.788868248462677
0 references
Learning unary output two-tape automata from multiplicity and equivalence queries (English)
0 references
