Properties of words and the related homomorphisms
碩士 === 中原大學 === 應用數學研究所 === 83 === Let X be a finite alphabet and let X* be the free monoid generated by X. Let 1 denote the empty and let X+=X*-{1}. Any element of X* is called a word or a string and any subset of X* is called a language....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1995
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/11874005860320648072 |