Browsing by Author
Showing results 4939 to 4958 of 88685
< previous
next >
- Imelda Octa Tampubolon 1
- Imran Saeed Mirza 1
- Imtiyaz Yusuf 1
- In 1956, M.P. Schüzenberger proved that cyclic groups are the only groups which can appear as syntactic monoids of finite prefix codes. Later in 1985, P. Udomkavanich gave an algorithm to construct all finite prefix codes whose syntactic monoids are inverse semigroups. It was proved that such a code must be biprefix, so it is called a finite inverse biprefix code. In this thesis, for any given n ≥ 2, a finite inverse biprefix code C whose syntactic monoid M(C*) has exactly n nonzero n-classes is constructed via P. Udomkavanich’s algorithm. 1
- Indhira Kramomtong 3
- Indiana Gita Anggraeni 1
- Indiana University. Medical School 1
- Indonesian Institute of Sciences. Center for Documentation and Information 1
- Indra Wongyaofa 1
- Indrani Sulistyowati 1
- Ing Detlef Heinz 1
- Ing-On Mondranondra 3
- Ing-on Mondranondra 2
- Ing-orn Prasanchaimontri 1
- Ingersoll-Dayton, Berit 1
- Ingjin Naing 1
- Ingon P. Trebuil 1
- Ingorn Kimkong 2
- Inoue, Masashi 1
- Institute of Pathology (Rajavithi Hospital Compound) 1