A word of a special type containing complete information about the position of one word inside another. More precisely, an occurrence in an alphabet $ A $ is a word of the form $ P \star Q \star R $, where $ P, Q, R $ are words in $ A $, while $ \star $ is not a letter of that alphabet. The occurrence $ P \star Q \star R $ is also an occurrence of the word $ Q $ into the word $ PQR $. The word $ Q $ is called the base of this occurrence; the words $ P $ and $ R $ are known as the left and right wings, respectively. The concept of an occurrence may be made the base of a system of concepts which is convenient for the study of the syntactic structure of words of one type or another.
|||A.A. Markov, "Theory of algorithms" , Israel Program Sci. Transl. (1961) (Translated from Russian) (Also: Trudy Mat. Inst. Steklov. 42 (1954))|
|||N.M. Nagornyi, "The theory of algorithms" , Kluwer (1988) (Translated from Russian)|
The phrase "imbedded word" is not in common use in English. The (English) translation  speaks of an entry of one word in another and of left and right delimiters (rather than occurrence, left and right wings, which are used in the (English) translation ). Other English-speaking authors tend to refer to an occurrence of one word as a subword (or segment) of another.
|[a1]||S. Eilenberg, "Automata, languages and machines" , A , Acad. Press (1974)|
|[a2]||J.L. Britton, "The word problem" Ann. of Math. , 77 (1963) pp. 16–32|
Imbedded word. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Imbedded_word&oldid=47314