LP-1996-05: Angluin's Theorem for Indexed Families of R.E. Sets and Applications

LP-1996-05: de Jongh, Dick and Kanazawa, Makoto (1996) Angluin's Theorem for Indexed Families of R.E. Sets and Applications. [Report]

[thumbnail of Full Text] Text (Full Text)
LP-1996-05.text.ps.gz
Download (112kB)
[thumbnail of Abstract] Text (Abstract)
LP-1996-05.abstract.txt
Download (467B)

Abstract

We extend Angluin's (1980) theorem to characterize identifiability of indexed
families of r.e. languages, as opposed to indexed families of recursive
languages. We also prove some variants characterizing conservativity and two
other similar restrictions, paralleling Zeugmann, Lange, and Kapur's (1992,
1995) results for indexed families of recursive languages.

Item Type: Report
Report Nr: LP-1996-05
Series Name: Logic, Philosophy and Linguistics (LP)
Year: 1996
Date Deposited: 12 Oct 2016 14:39
Last Modified: 12 Oct 2016 14:39
URI: https://eprints.illc.uva.nl/id/eprint/1241

Actions (login required)

View Item View Item
ILLC Preprints and Publications is powered by EPrints 3.4 which is developed by the School of Electronics and Computer Science at the University of Southampton. About EPrints | Accessibility