Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Inference of regular grammars via skeletons
IEEE Transactions on Systems, Man and Cybernetics
IEEE Transactions on Pattern Analysis and Machine Intelligence
A hierarchy of language families learnable by regular language learning
Information and Computation
Inference of Reversible Languages
Journal of the ACM (JACM)
Learning a Subclass of Linear Languages from Positive Structural Information
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Permutations and Control Sets for Learning Non-regular Language Families
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
What Is the Search Space of the Regular Inference?
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Learning k-piecewise testable languages from positive data
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Locally Threshold Testable Languages in Strict Sense: Application to the Inference Problem
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Identifying Terminal Distinguishable Languages
Annals of Mathematics and Artificial Intelligence
Parameterized Complexity
On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Some Classes of Regular Languages Identifiable in the Limit from Positive Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Locally Testable Even Linear Languages from Positive Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Fragmentation: Enhancing Identifiability
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Algorithms for Learning Function Distinguishable Regular Languages
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Approximative Learning of Regular Languages
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
| Hi-index | 0.00 |
We show how appropriately chosen functions which we call distinguishing can be used to make deterministic finite automata backward deterministic. These ideas can be exploited to design regular language classes identifiable in the limit from positive samples. Special cases of this approach are the k-reversible and terminal distinguishable languages as discussed in [1,8,10,17,18].