On the amount of nonconstructivity in learning formal languages from text
On the amount of nonconstructivity in learning formal languages from text
复制标题
论从文本中学习形式语言的非建构性程度
DOI:
10.1016/j.ic.2020.104668
复制
发表时间:
2020
影响因子:
1
通讯作者:
Zeugmann Thomas
中科院分区:
文献类型:
--
作者:
Jain Sanjay;Stephan Frank;Zeugmann Thomas
Nonconstructive computations by various types of machines and automata have been considered by, for example, Karp and Lipton as well as Freivalds. They allow to regard more complicated algorithms from the viewpoint of much 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. 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.
登录
查看更多内容
DOI:
10.1007/978-3-642-02979-0_26
发表时间:
2009
期刊:
International Conference on Implementation and Application of Automata
影响因子:
--
作者:
R. Freivalds
通讯作者:
R. Freivalds
影响因子:
1
作者:
Olaf Beyersdorff;J. Köbler;Sebastian Müller
通讯作者:
Sebastian Müller
DOI:
10.1007/3-540-62064-8_12
发表时间:
1996
期刊:
Ershov Memorial Conference
影响因子:
--
作者:
R. Freivalds;T. Zeugmann
通讯作者:
T. Zeugmann
DOI:
10.1016/j.tcs.2010.05.038
发表时间:
2010
期刊:
Theor. Comput. Sci.
影响因子:
--
作者:
R. Freivalds
通讯作者:
R. Freivalds
DOI:
--
发表时间:
2007
期刊:
Journal of Symbolic Logic (JSL)
影响因子:
--
作者:
S. Cook;J. Krajícek
通讯作者:
J. Krajícek