INFERRING UNIQUELY TERMINATING REGULAR LANGUAGES FROM POSITIVE DATA

Authors
MAKINEN E
Citation
E. Makinen, INFERRING UNIQUELY TERMINATING REGULAR LANGUAGES FROM POSITIVE DATA, Information processing letters, 62(2), 1997, pp. 57-60
Citations number
10
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
62
Issue
2
Year of publication
1997
Pages
57 - 60
Database
ISI
SICI code
0020-0190(1997)62:2<57:IUTRLF>2.0.ZU;2-8
Abstract
We define a new subclass of regular languages, called uniquely termina ting regular languages, which can be inferred from positive data. The class of uniquely terminating regular languages and the previously kno wn subclasses of regular languages inferable from positive data are in comparable. (C) 1997 Elsevier Science B.V.