On the languages accepted by finite reversible automata
14th International Colloquium on Automata, languages and programming
Inference of regular grammars via skeletons
IEEE Transactions on Systems, Man and Cybernetics
A hierarchy of language families learnable by regular language learning
Information and Computation
Learning approximately regular languages with reversible languages
Theoretical Computer Science
Inference of Reversible Languages
Journal of the ACM (JACM)
Parallel communicating grammar systems with terminal transmission
Acta Informatica
Permutations and Control Sets for Learning Non-regular Language Families
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
MLDM '01 Proceedings of the Second International Workshop on Machine Learning and Data Mining in Pattern Recognition
On Approximately Identifying Concept Classes in the Limit
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Identification of Function Distinguishable Languages
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Identifying Terminal Distinguishable Languages
Annals of Mathematics and Artificial Intelligence
MLDM '01 Proceedings of the Second International Workshop on Machine Learning and Data Mining in Pattern Recognition
Algorithms for Learning Function Distinguishable Regular Languages
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Identification of function distinguishable languages
Theoretical Computer Science
Identifying Terminal Distinguishable Languages
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We show how appropriately chosen functions f which we call distinguishing can be used to make deterministic finite automata backward deterministic. These ideas have been exploited to design regular language classes called f-distinguishable which are identifiable in the limit from positive samples. Special cases of this approach are the k-reversible and terminal distinguishable languages as discussed in [1,3,5,15,16]. Here, we give new characterizations of these language classes. Moreover, we show that all regular languages can be approximated in the setting introduced by Kobayashi and Yokomori [12,13]. Finally, we prove that the class of all function-distinguishable languages is equal to the class of regular languages.