The Citing articles tool gives a list of articles citing the current article. The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Application and Theory of Petri Nets and Concurrency
Adam Burke, Sander J. J. Leemans and Moe Thandar Wynn Lecture Notes in Computer Science, Application and Theory of Petri Nets and Concurrency 12734 312 (2021) https://doi.org/10.1007/978-3-030-76983-3_16
An Entropy Metric for Regular Grammar Classification and Learning with Recurrent Neural Networks
Grammatical Inference: Theoretical Results and Applications
Borja Balle, Jorge Castro and Ricard Gavaldà Lecture Notes in Computer Science, Grammatical Inference: Theoretical Results and Applications 6339 271 (2010) https://doi.org/10.1007/978-3-642-15488-1_24
An Iterative Relative Entropy Minimization-Based Data Selection Approach for n-Gram Model Adaptation
Abhinav Sethy, Panayiotis G. Georgiou, Bhuvana Ramabhadran and Shrikanth Narayanan IEEE Transactions on Audio, Speech, and Language Processing 17(1) 13 (2009) https://doi.org/10.1109/TASL.2008.2006654
Computation of distances for regular and context-free probabilistic languages
ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
CORINNA CORTES, MEHRYAR MOHRI, ASHISH RASTOGI and MICHAEL RILEY International Journal of Foundations of Computer Science 19(01) 219 (2008) https://doi.org/10.1142/S0129054108005644
E. Vidal, F. Thollard, C. de la Higuera, F. Casacuberta and R.C. Carrasco IEEE Transactions on Pattern Analysis and Machine Intelligence 27(7) 1013 (2005) https://doi.org/10.1109/TPAMI.2005.147
Kwok-Chung Au and Kwok-Wai Cheung Lecture Notes in Computer Science, Advances in Knowledge Discovery and Data Mining 3056 590 (2004) https://doi.org/10.1007/978-3-540-24775-3_70
Gradual probabilistic DFA learning with caching for conversational agents
Rafael C. Carrasco, Jose Oncina and Jorge Calera Lecture Notes in Computer Science, Grammatical Inference 1433 187 (1998) https://doi.org/10.1007/BFb0054075
Computing the relative entropy between regular tree languages