Discontinuities in pattern inference

Theoretical Computer Science

Volumn 397, Issue 1-3, 2008, Pages 166-193

  Reidenbach, Daniel ^a  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

Ambiguity; Combinatorics on words; Inductive inference; Morphisms; Pattern languages; Telltales

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER PROGRAMMING LANGUAGES; DATA REDUCTION; PROBLEM SOLVING;

AMBIGUITY; BINARY ALPHABETS; COMBINATORICS ON WORDS; INDUCTIVE INFERENCE; MORPHISMS; TELLTALES;

TEXT PROCESSING;

EID: 43049105719     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.02.029     Document Type: Article

References (41)

1. Angluin D. Finding patterns common to a set of strings. Journal of Computer and System Sciences 21 (1980) 46-62
2. Angluin D. Inductive inference of formal languages from positive data. Information and Control 45 (1980) 117-135
3. Baliga G.R., Case J., and Jain S. The synthesis of language learners. Information and Computation 152 (1999) 16-43
4. Choffrut C., and Karhumäki J. Combinatorics of words. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages vol. 1 (1997), Springer 329-438 (Chapter 6)
5. Ehrenfeucht A., and Rozenberg G. Finding a homomorphism between two words is NP-complete. Information Processing Letters 9 (1979) 86-88
6. Filè G. The relation of two patterns with comparable language. Proc. 5th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1988. Lecture Notes in Computer Science (1988), vol. 294 184-192
7. Freydenberger D.D., Reidenbach D., and Schneider J.C. Unambiguous morphic images of strings. International Journal of Foundations of Computer Science 17 (2006) 601-628
8. Gold E.M. Language identification in the limit. Information and Control 10 (1967) 447-474
9. D. Hamm, J. Shallit, Characterization of finite and one-sided infinite fixed points of morphisms on free monoids, Technical Report CS-99-17, Dep. of Computer Science, University of Waterloo, 1999. http://www.cs.uwaterloo.ca/ shallit/papers.html
10. Harju T., and Morphisms J.Karhumki. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages vol. 1 (1997), Springer 439-510 (Chapter 7)
11. Head T. Fixed languages and the adult languages of 0L schemes. International Journal of Computer Mathematics 10 (1981) 103-107
12. Jain S., Osherson D., Royer J.S., and Sharma A. Systems That Learn. second edition (1999), MIT Press, Cambridge, MA
13. Jiang T., Kinber E., Salomaa A., Salomaa K., and Yu S. Pattern languages with and without erasing. International Journal of Computer Mathematics 50 (1994) 147-163
14. Jiang T., Salomaa A., Salomaa K., and Yu S. Decision problems for patterns. Journal of Computer and System Sciences 50 (1995) 53-63
15. Lange S. Algorithmic Learning of Recursive Languages (2000), Mensch & Buch, Berlin
16. Lange S., and Wiehagen R. Polynomial-time inference of arbitrary pattern languages. New Generation Computing 8 (1991) 361-370
17. Lange S., and Zilles S. Formal language identification: Query learning vs. Gold-style learning. Information Processing Letters 91 (2004) 285-292
18. Lange S., and Zilles S. Relations between Gold-style learning and query learning. Information and Computation 203 (2005) 211-237
19. Lipponen M., and Pǎun G. Strongly prime PCP words. Discrete Applied Mathematics 63 (1995) 193-197
20. Lothaire M. Combinatorics on Words (1983), Addison-Wesley, Reading, MA
21. Makanin G.S. The problem of solvability of equations in a free semi-group. Soviet Mathematics Doklady 18 (1977) 330-334
22. Mateescu A., and Salomaa A. Finite degrees of ambiguity in pattern languages. RAIRO Informatique théoretique et Applications 28 (1994) 233-253
23. Salomaa A. Patterns. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages vol. 1 (1997), Springer 230-242 (Chapter 4.6)
24. A.R. Mitchell, Learnability of a subclass of extended pattern languages, in: Proc. 11th Annual Conference on Computational Learning Theory, COLT 1998, 1998, pp. 64-71
25. Ohlebusch E., and Ukkonen E. On the equivalence problem for E-pattern languages. Theoretical Computer Science 186 (1997) 231-248
26. Reidenbach D. An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages. Journal of Automata, Languages and Combinatorics 12 3 (2007)
27. Reidenbach D. A discontinuity in pattern inference. Proc. 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004. Lecture Notes in Computer Science vol. 2996 (2004) 129-140
28. Reidenbach D. On the equivalence problem for E-pattern languages over small alphabets. Proc. 8th International Conference on Developments in Language Theory, DLT 2004. Lecture Notes in Computer Science vol. 3340 (2004) 368-380
29. Reidenbach D. On the learnability of E-pattern languages over small alphabets. Proc. 17th Annual Conference on Learning Theory, COLT 2004. Lecture Notes in Artificial Intelligence vol. 3120 (2004) 140-154
30. Reidenbach D. A non-learnable class of E-pattern languages. Theoretical Computer Science 350 (2006) 91-102
31. Reischuk R., and Zeugmann T. An average-case optimal one-variable pattern language learner. Journal of Computer and System Sciences 60 (2000) 302-335
32. Rogers H. Theory of Recursive Functions and Effective Computability (1992), MIT Press, Cambridge, MA 3rd print
33. Rossmanith P., and Zeugmann T. Stochastic finite learning of the pattern languages. Machine Learning 44 (2001) 67-91
34. Rozenberg G., and Salomaa A. Handbook of Formal Languages vol. 1 (1997), Springer, Berlin
35. Salomaa K. Patterns. In: Martin-Vide C., Mitrana V., and Pǎun G. (Eds). Formal Languages and Applications. Studies in Fuzziness and Soft Computing vol. 148 (2004), Springer 367-379
36. Shinohara T. Polynomial time inference of extended regular pattern languages. Proc. RIMS Symposia on Software Science and Engineering, Kyoto. Lecture Notes in Computer Science vol. 147 (1982) 115-127
37. Shinohara T., and Arikawa S. Pattern inference. In: Jantke K.P., and Lange S. (Eds). Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report. Lecture Notes in Artificial Intelligence vol. 961 (1995), Springer, Berlin 259-291
38. Thue A. Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl. 7 (1906)
39. Wiehagen R., and Zeugmann T. Ignoring data may be the only way to learn efficiently. Journal of Experimental and Theoretical Artificial Intelligence 6 (1994) 131-144
40. K. Wright, Identification of unions of languages drawn from an identifiable class, in: Proc. 2nd Annual Workshop on Computational Learning Theory, COLT 1989, 1989, pp. 328-333
41. Zeugmann T., and Lange S. A guided tour across the boundaries of learning recursive languages. In: Jantke K.P., and Lange S. (Eds). Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report. Lecture Notes in Artificial Intelligence vol. 961 (1995), Springer, Berlin 190-258