Preview
Unable to display preview. Download preview PDF.
References
R.A. Baeza-Yates and L.O. Fuentes. A framework to animate string algorithms. Inform. Process. Lett., 59(5):241–244, 1996.
François Bertault. Padnon: un logiciel de tracé automatique de graphes en trois dimensions. Research Report 3130, INRIA, March 1997.
A. Blumer, J. Blumer, D. Haussier, A. Ehrenfeucht, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40:31–55, 1985.
Christian Charras and Thierry Lecroq. Exact string matching algorithms. URL: http://wvw.dir.univ-rouen.fr/~charras/string/.
Maxim Crochemore and Wojciech Rytter. Text Algorithms. Oxford University Press, 1994.
G. Kucherov and M. Rusinowitch. Matching a set of strings with variable length don't cares. In E. Ukkonen, editor, Proceedings of the 6th Symposium on Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pages 230–247, Helsinki (Finland), July 1995. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertault, F., Kucherov, G. (1998). Visualization of dynamic automata using Padnon. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031378
Download citation
DOI: https://doi.org/10.1007/BFb0031378
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64694-5
Online ISBN: 978-3-540-69104-4
eBook Packages: Springer Book Archive