Chord Diagrams, d-Diagrams, and Knots

A method of representing knots, links, and singular knots and links by words in a finite alphabet and so-called d-diagrams is given. A representation of the chord diagram algebra by words in a finite alphabet is considered. This method, unlike coding by Gauss diagrams, allows one to consider knots and links simultaneously. An algorithm for recognition of diagrams of classical knots in terms of d-diagrams is given. Bibliography: 9 titles.