Author:
Bernemann Rebecca,König Barbara,Schaffeld Matthias,Weis Torben
Publisher
Springer Nature Switzerland
Reference25 articles.
1. Abney, S.P., McAllester, D.A., Pereira, F.: Relating probabilistic grammars and automata. In: Proceedings of ACL 1999 (Annual Meeting of the Association for Computational Linguistics), pp. 542–549. ACL (1999)
2. Angluin, D.: Learning regular sets from queries and counter-examples. Inf. Control 75(2), 87–106 (1987)
3. Bahl, L.R., Jelinek, F., Mercer, R.L.: A maximum likelihood approach to continuous speech recognition. IEEE Trans. Pattern Anal. Mach. Intell. 5(2), 179–190 (1983)
4. Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press (2008)
5. Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Stat. 41(1), 164–171 (1970)