Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference29 articles.
1. Abe, N., & Warmuth, M. K. (1992). On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 9, 205–260.
2. Adriaans, P., Trautwein, M., & Vervoort, M. (2000). Towards high speed grammar induction on large text corpora. In V. Hlavac, K. G. Jeffery, & J. Wiedermann (Eds.), SOFSEM 2000: Theory and practice of informatics (pp. 173–186). Springer Verlag.
3. Boasson, L., & Senizergues, S. (1985). NTS languages are deterministic and congruential. J. Comput. Syst. Sci., 31(3), 332–342.
4. Book, R., & Otto, F. (1993). String rewriting systems. Springer Verlag.
5. Book, R. V. (1981). NTS grammars and Church-Rosser systems. Information Processing Letters, 13(2), 73–76.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献