Skip to Main content Skip to Navigation
New interface
Journal articles

Identification of biRFSA languages

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Aurélien Lemay Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 1:53:07 PM
Last modification on : Friday, February 4, 2022 - 3:11:31 AM
Long-term archiving on: : Friday, October 26, 2012 - 3:47:09 PM


Files produced by the author(s)




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⟩



Record views


Files downloads