Disjunctive Languages and Codes
暂无分享,去创建一个
* A i A + A i " X + AB = {xylx c A, y ~ B}, A = o and = u A word w ~ is i=0+ i=l called primitive if w = fn, f c X , implies n = i. A non-empty language A such that A ~ X + is called a code if XlX2...x n = ylY2...y m and xi,Y j ~ A for every i and j implies n = m and x i = Yi for all i. A code A is said to be a prefix (suffix) code if A n AX + = ~ (A n X+A=~). For any language A, the relations PA and RA defined by x E y (PA) if and only if A..x = A..y
[1] Huei-Jan Shyr,et al. Disjunctive Languages On a Free Monoid , 1977, Inf. Control..
[2] C. M. Reis,et al. Some Properties of Disjunctive Languages on a Free Monoid , 1978, Inf. Control..
[3] M. Schützenberger,et al. The equation $a^M=b^Nc^P$ in a free group. , 1962 .
[4] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..