| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9656004 | Electronic Notes in Theoretical Computer Science | 2005 | 16 Pages |
Abstract
We see that prefix-closed languages are relatively hard to learn compared to arbitrary regular languages. The optimization, however, shows positive results.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Therese Berg, Bengt Jonsson, Martin Leucker, Mayank Saksena,