Learning two-tape automata from queries and counterexamples (Q4879209)
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 881753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning two-tape automata from queries and counterexamples |
scientific article; zbMATH DE number 881753 |
Statements
Learning two-tape automata from queries and counterexamples (English)
0 references
27 May 1996
0 references
learning problem
0 references
deterministic finite automata
0 references
0.7944154739379883
0 references
0.793944239616394
0 references
