Learning regular languages using RFSAs
- 3 December 2003
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 313 (2), 267-294
- https://doi.org/10.1016/j.tcs.2003.11.008
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Some Classes of Regular Languages Identifiable in the Limit from Positive DataLecture Notes in Computer Science, 2002
- Residual Finite State AutomataLecture Notes in Computer Science, 2001
- Efficient Ambiguity Detection in C-NFALecture Notes in Computer Science, 2000
- Approximate Statistical Tests for Comparing Supervised Classification Learning AlgorithmsNeural Computation, 1998
- Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithmLecture Notes in Computer Science, 1998
- Regular LanguagesPublished by Springer Science and Business Media LLC ,1997
- INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIMESeries in Machine Perception and Artificial Intelligence, 1992
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Complexity of automaton identification from given dataInformation and Control, 1978
- Derivatives of Regular ExpressionsJournal of the ACM, 1964