Communications of the ACM
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Inductive inference of approximations
Information and Control
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
Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
The correct definition of finite elasticity: corrigendum to identification of unions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Handbook of theoretical computer science (vol. A)
A hierarchy of language families learnable by regular language learning
Information and Computation
Learning approximately regular languages with reversible languages
Theoretical Computer Science
Noncounting Context-Free Languages
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
On inferring zero-reversible languages
Acta Cybernetica
Faster exact algorithms for hard problems: a parameterized point of view
Discrete Mathematics
Parallel communicating grammar systems with terminal transmission
Acta Informatica
Introduction to Algorithms
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
On the Language Accepted by Finite Reversible Automata
ICALP '87 Proceedings of the 14th International Colloquium, on Automata, Languages and Programming
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
Inductive Inference Machines That Can Refute Hypothesis Spaces
ALT '93 Proceedings of the 4th International Workshop on Algorithmic Learning Theory
Inductive Inference of an Approximate Concept from Positive Data
AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
On Approximately Identifying Concept Classes in the Limit
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Identifying Terminal Distinguishable Languages
Annals of Mathematics and Artificial Intelligence
Parameterized Complexity
Automatic information extraction from large websites
Journal of the ACM (JACM)
Learning Left-to-Right and Right-to-Left Iterative Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Algorithms for learning regular expressions from positive data
Information and Computation
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Generalizing over several learning settings
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Automatic learning of subclasses of pattern languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Automatic learners with feedback queries
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Learnability of automatic classes
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
String extension learning using lattices
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science
Learnability of automatic classes
Journal of Computer and System Sciences
Automatic learning of subclasses of pattern languages
Information and Computation
Inferring descriptive generalisations of formal languages
Journal of Computer and System Sciences
Automatic learners with feedback queries
Journal of Computer and System Sciences
| Hi-index | 5.23 |
We show how appropriately chosen functions f which we call distinguishing can be used to make deterministic finite automata backward deterministic. This idea can be 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 Angluin (J. Assoc. Comput. Mach. 29 (3) (1982) 741), Fernau (Technical Report WSI-99-23, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, 1999, Short version published in the proceedings of AMAI 2000, see http://rutcot. rutgers. edu/~amai/aimath00/AcceptedCont.htm, Proc. 15th Internat. Conf. on Pattern Recognition (ICPR 2000), Vol. 2, IEEE Press, New York, 2000, pp. 125-128), Radhakrishnan (Ph.D. Thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, India, 1987), Radhakrishnan and Nagaraja (IEEE Trans. Systems, Man Cybernet. 17 (6) (1987) 982). Moreover, we show that all regular languages may be approximated in the setting introduced by Kobayashi and Yokomori (in: K. P. Jantke, T. Shinohara, Th. Zeugmann (Eds.), Proc. Sixth Internat. Conf. Algorithmic Learning Theory (ALT'95), Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence, Vol. 997, Springer, Berlin, 1995, pp. 298-312), (Theoret. Comput. Sci. 174 (1997) 251-257) by any class of f-distinguishable languages. Observe that the class of all function-distinguishable languages is equal to the class of regular languages.