Abstract
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].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin. Inference of reversible languages. Journal of the Association for Computing Machinery, 29(3):741–765, 1982. 116, 117, 119, 125, 126, 127
D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87–106, 1987. 116, 117
R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999. 127
R. G. Downey, M. R. Fellows, and U. Stege. Parameterized complexity: A framework for systematically confronting computational intractability. In Contemporary Trends in Discrete Mathematics:F rom DIMACS and DIMATIA to the Future, volume 49 of AMS-DIMACS, pages 49–99. AMS Press, 1999. 127
P. Dupont. Incremental regular inference. In L. Miclet and C. de la Higuera, editors, Proceedings of the Third International Colloquium on Grammatical Inference (ICGI-96):L earning Syntax from Sentences, volume 1147 of LNCS/LNAI, pages 222–237. Springer, 1996. 129
P. Dupont and L. Miclet. Inférence grammaticale régulière: fondements théoriques et principaux algorithmes. Technical Report RR-3449, INRIA, 1998. 125, 129
P. Dupont, L. Miclet, and E. Vidal. What is the search space of the regular inference? In R. C. Carrasco and J. Oncina, editors, Proceedings of the Second International Colloquium on Grammatical Inference (ICGI-94):Gr ammatical Inference and Applications, volume 862of LNCS/LNAI, pages 25–37. Springer, 1994. 129
H. Fernau. Learning of terminal distinguishable languages. 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://rutcor.rutgers.edu/~amai/AcceptedCont.htm. 116, 129, 130
H. Fernau. Identifying terminal distinguishable languages. Submitted revised version of [8]. 119, 120, 129
H. Fernau. k-gram extensions of terminal distinguishable languages. In Proc. International Conference on Pattern Recognition. IEEE/IAPR, 2000. To appear. 116, 118, 119, 126, 127
H. Fernau and J. M. Sempere. Permutations and control sets for learning nonregular language families. In Proc. International Conference on Grammatical Inference. Springer, 2000. To appear. 129
P. García and E. Vidal. Inference of k-testable languages in the strict sense and applications to syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12:920–925, 1990. 128
E. M. Gold. Language identification in the limit. Information and Control (now Information and Computation), 10:447–474, 1967. 116, 120
J. Gregor. Data-driven inductive inference of finite-state automata. International Journal of Pattern Recognition and Artificial Intelligence, 8(1):305–322, 1994. 117
S. Jain, D. Osherson, J. S. Royer, and A. Sharma. Systems That Learn. MIT Press, 2nd edition, 1999. 123
R. Niedermeier. Some prospects for effcient fixed parameter algorithms (invited paper). In B. Rovan, editor, SOFSEM’98, volume 1521 of LNCS, pages 168–185. Springer, 1998. 127
V. Radhakrishnan. Grammatical Inference from Positive Data:An Effective Integrated Approach. PhD thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay (India), 1987. 116, 117, 129
V. Radhakrishnan and G. Nagaraja. Inference of regular grammars via skeletons. IEEE Transactions on Systems, Man and Cybernetics, 17(6):982–992, 1987. 116, 117, 118, 119, 126
P. Rossmanith. Learning from random text. In O. Watanabe and T. Yokomori, editors, Algorithmic Learning Theory (ALT’99), volume 1720 of LNCS/LNAI, pages 132–144. Springer, 1999. 116
J. Ruiz, S. España and P. García. Locally threshold testable languages in strict sense: application to the inference problem In V. Honavar and G. Slutski, editors, Proceedings of the Fourth International Colloquium on Grammatical Inference (ICGI-98), volume 1433 of LNCS/LNAI, pages 150–161. Springer, 1998. 128
J. Ruiz and P. García. Learning k-piecewise testable languages from positive data. In L. Miclet and C. de la Higuera, editors, Proceedings of the Third International Colloquium on Grammatical Inference (ICGI-96):L earning Syntax from Sentences, volume 1147 of LNCS/LNAI, pages 203–210. Springer, 1996. 128
J. M. Sempere and G. Nagaraja. Learning a subclass of linear languages from positive structural information. In V. Honavar and G. Slutski, editors, Proceedings of the Fourth International Colloquium on Grammatical Inference (ICGI-98), volume 1433 of LNCS/LNAI, pages 162–174. Springer, 1998. 121
Y. Takada. A hierarchy of language families learnable by regular language learning. Information and Computation, 123:138–145, 1995. 129
L. G. Valiant. A theory of the learnable. Communications of the ACM, 27:1134–1142, 1984. 116
R. Wiehagen. Identification of formal languages. In Mathematical Foundations of Computer Science (MFCS’77), volume 53 of LNCS, pages 571–579. Springer, 1977. 116
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernau, H. (2000). Identification of Function Distinguishable Languages. In: Arimura, H., Jain, S., Sharma, A. (eds) Algorithmic Learning Theory. ALT 2000. Lecture Notes in Computer Science(), vol 1968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40992-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-40992-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41237-3
Online ISBN: 978-3-540-40992-2
eBook Packages: Springer Book Archive