Several remarks on computations of labelled Markov algorithms

Abstract

is denoted by L(G). Let A~ = {£0' ~i ..... ~k '~} Permission to copy without fee all or pamt of this material is granted provided that the copies a r e not made or distributed for dire~t eommerclal advantaEe, the ACM oopyriEht notlce and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. 1982 ACM 0-89791-071-0/82/0400-0023 $00.75 be a finite alphabet which contains k + 2 elements;