Difficulties in Forcing Fairness of Polynomial Time Inductive Inference-Reference-Cited by-同舟云学术

Difficulties in Forcing Fairness of Polynomial Time Inductive Inference

Published:2009 Issue: Volume: Page:263-277
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Case John,Kötzing Timo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-04414-4_23

Reference25 articles.

1. Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)

2. Bārzdiņš, J.: Inductive inference of automata, functions and programs. In: Int. Math. Congress, Vancouver, pp. 771–776 (1974)

3. Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Information and Control 28, 125–155 (1975)

4. Burgin, M.: Grammars with prohibition and human-computer interaction. In: Proceedings of the 2005 Business and Industry Symposium and the 2005 Military, Government, and Aerospace Simulation Symposium, pp. 143–147. Society for Modeling and Simulation (2005)

5. Carlucci, L., Case, J., Jain, S.: Learning correction grammars. Journal of Symbolic Logic 74(2), 489–516 (2009)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learnability and positive equivalence relations;Information and Computation;2022-04

2. Learners based on transducers;Information and Computation;2020-12

3. Revisiting Shinohara's algorithm for computing descriptive patterns;Theoretical Computer Science;2018-07

4. Learners Based on Transducers;Language and Automata Theory and Applications;2018

5. Automatic learning from positive data and negative counterexamples;Information and Computation;2017-08