Abstract
Nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [18] and Freivalds [9, 10]. They allow to regard more complicated algorithms from the viewpoint of more primitive computational devices. The amount of nonconstructivity is a quantitative characterization of the distance between types of computational devices with respect to solving a specific problem.
This paper studies the amount of nonconstructivity needed to learn classes of formal languages from positive data. Different learning types are compared with respect to the amount of nonconstructivity needed to learn indexable classes and recursively enumerable classes, respectively, of formal languages from positive data. Matching upper and lower bounds for the amount of nonconstructivity needed are shown.
This is a preview of subscription content, log in via an institution to check access.
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
Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21(1), 46–62 (1980)
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45(2), 117–135 (1980)
Barzdin, J.: Inductive inference of automata, functions and programs. In: Proc. of the 20th International Congress of Mathematicians, Vancouver, Canada, pp. 455–460 (1974); republished in Amer. Math. Soc. Transl. 109 (2), 107– 112 (1977)
Bārzdiņš, J.M.: Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set. Soviet Mathematics Doklady 9, 1251–1254 (1968)
Beyersdorff, O., Köbler, J., Müller, S.: Proof systems that take advice. Information and Computation 209(3), 320–332 (2011)
Cook, S., Krajiček, J.: Consequences of the provability of NP ⊆ P/poly. The Journal of Symbolic Logic 72(4), 1353–1371 (2007)
Damm, C., Holzer, M.: Automata that Take Advice. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 149–158. Springer, Heidelberg (1995)
Erdős, P.: Some remarks on the theory of graphs. Bulletin of the American Mathematical Society 53(4), 292–294 (1947)
Freivalds, R.: Amount of Nonconstructivity in Finite Automata. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol. 5642, pp. 227–236. Springer, Heidelberg (2009)
Freivalds, R.: Amount of nonconstructivity in deterministic finite automata. Theoretical Computer Science 411(38-39), 3436–3443 (2010)
Freivalds, R., Zeugmann, T.: On the Amount of Nonconstructivity in Learning Recursive Functions. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 332–343. Springer, Heidelberg (2011)
Freivalds, R., Zeugmann, T.: Co–Learning of Recursive Languages from Positive Data. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds.) PSI 1996. LNCS, vol. 1181, pp. 122–133. Springer, Heidelberg (1996)
Gold, E.M.: Language identification in the limit. Inform. Control 10(5), 447–474 (1967)
Jain, S., Kinber, E., Lange, S., Wiehagen, R., Zeugmann, T.: Learning languages and functions by erasing. Theoretical Computer Science 241(1-2), 143–189 (2000)
Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems that Learn: An Introduction to Learning Theory, 2nd edn. MIT Press, Cambridge (1999)
Jain, S., Stephan, F., Zeugmann, T.: On the amount of nonconstructivity in learning formal languages from text. Tech. Rep. TCS-TR-A-12-55, Division of Computer Science, Hokkaido University (2012)
Jantke, K.P.: Monotonic and non-monotonic inductive inference. New Generation Computing 8(4), 349–360 (1991)
Karp, R.M., Lipton, R.J.: Turing machines that take advice. L’ Enseignement Mathématique 28, 191–209 (1982)
Lange, S., Zeugmann, T.: Types of monotonic language learning and their characterization. In: Haussler, D. (ed.) Proc. 5th Annual ACM Workshop on Computational Learning Theory, pp. 377–390. ACM Press, New York (1992)
Lange, S., Zeugmann, T.: Language learning in dependence on the space of hypotheses. In: Pitt, L. (ed.) Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pp. 127–136. ACM Press, New York (1993)
Lange, S., Zeugmann, T., Zilles, S.: Learning indexed families of recursive languages from positive data: A survey. Theoretical Computer Science 397(1-3), 194–232 (2008)
Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill (1967); reprinted, MIT Press 1987
Zeugmann, T., Lange, S.: A Guided Tour Across the Boundaries of Learning Recursive Languages. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS (LNAI), vol. 961, pp. 190–258. Springer, Heidelberg (1995)
Zeugmann, T., Minato, S., Okubo, Y.: Theory of Computation. Corona Publishing Co, Ltd. (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Stephan, F., Zeugmann, T. (2012). On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data. In: Agrawal, M., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2012. Lecture Notes in Computer Science, vol 7287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29952-0_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-29952-0_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29951-3
Online ISBN: 978-3-642-29952-0
eBook Packages: Computer ScienceComputer Science (R0)