| I. Hakala, On word equations and the morphism equivqalence problem for loop languages, Academic dissertation, Faculty of Science, University of Oulu (1997). |
....e ectively determined and this subject has been studied in several papers. A survey of the results as well as a comprehensive list of references can be found in [CK97] and [HKa97] For context sensitive languages, nite test sets cannot in general be e ectively constructed. The articles [Alb68] [Hak68], Hol01] HaKo99] HaKo97] and [Kor98] contain results on restricted types of context sensitive languages. By [EKR83] every language over a two letter alphabet has a test set of size at most three. Test set research on commutative languages was started in [AW83] and the work was continued in ....
I. Hakala, On word equations and the morphism equivqalence problem for loop languages, Academic dissertation, Faculty of Science, University of Oulu, 1968.
No context found.
I. Hakala, On word equations and the morphism equivqalence problem for loop languages, Academic dissertation, Faculty of Science, University of Oulu (1997).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC