Identification of biRFSA languages - INRAE - Institut national de recherche pour l’agriculture, l’alimentation et l’environnement Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2006

Identification of biRFSA languages

Résumé

The task of identifying a language from a set of its words is not an easy one. For instance, it is not feasible to identify regular languages in the general case. Therefore, looking for subclasses of regular languages that can be identi?ed in this framework is an interesting problem. One of the most classical identi?able classes is the class of reversible languages, introduced by D. Angluin, also called bideterministic languages as they can be represented by deterministic automata (DFA) whose reverse is also deterministic. Residual Finite State Automata (RFSA) on the other hand is a class of non deterministic automata that shares some properties with DFA. In particular, DFA are RFSA and RFSA can be much smaller. We study here learnability of the class of languages that can be represented by biRFSA: RFSA whose reverse are RFSA. We prove that this class is not identi?able in general but we present two subclasses that are learnable, the second one being identi?able in polynomial time.
Fichier principal
Vignette du fichier
Identification-of-biRFSA-languages.pdf (182.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00536545 , version 1 (16-11-2010)

Identifiants

Citer

Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte. Identification of biRFSA languages. Theoretical Computer Science, 2006, 356 (1-2), pp.212-223. ⟨10.1016/j.tcs.2006.01.029⟩. ⟨inria-00536545⟩
130 Consultations
171 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More