The class of languages generated by unary TOL systems with regular control is considered and investigated. It is shown that the equivalence problem for unary TOL systems with ultimately periodic regular control is decidable. The problems for other versions of unary TOL systems are discussed.
|Number of pages||2|
|Journal||Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E|
|Publication status||Published - 1981 Aug|
ASJC Scopus subject areas