The automata complexity of the language transformation schema that contains operations with restricted degree.
Nguyễn Văn Định · Journal of Computer Science and Cybernetics · 2012
In accordance with the concept of automaton with the output we have built the language transformation schema E (see [6]).In this paper we study the relation between the automata complexity g(E), the number of essential vertices lEI and the depth of operations 5 on a language transformation schema.The estimation of the automata complexity of a language transformation schema that holds operations with restricted degree is also given.Tom t~t.Du'a tren kh ai n iern 0 to mat co loi ra, ta xay dung oU"<!C1U"<)"c 00 bien oo'i ngori ngir (BDNN) [6].Khi cac 1U"<!c 00 BDNN chira cac ph ep l~p khOng han che thl oi? ph ire tap 0 to mat cua no khong phu th uoc v ao so ph ep l~p v a oa d u'o'c danh gia bd•i [6]' nhirng khi so ph ep l~p, cling nhu• mot so phep totin kh ac nhu• ph ep lily cac c~p tjr chRn, lily cac c~p t ir le , ph ep bo' sung ... , co b~c bi h ari cM thl oi? ph ire tap 0 to mat cd a cac hro'c 00 BDNN se ph u th uoc v ao oi? sau o~t dilu (b~c) cd a cac phep toano Bai nay trinh bay moi lien h~giira oi? ph u'c tap 0 to mat, so dinh cot yeu va oi? sau o~t dfi u cac ph ep toin cila mot lu'o'c 00 BDNN co chira cic ph ep toin co b~c ducc han che.