%0 Journal Article
%T THE NONDETERMINISTIC FINITE AUTOMATON WHOSE GTB-FAMILY IS RECOGNIZABLE<br>识别可识 Gtb-语言族的不确定有限自动机
%A WANG CHUAN-HONG
%A <br>王传洪
%J 系统科学与数学
%D 1988
%I 
%X In this paper,we discuss the nondeterministic finite automaton whose Gtb-family of lan-guages is recognizable and obtain a sufficient and necessary condition for the recognizability ofthe Gtb-family of languages.Hence the open problem posed by I.M.Havel in 1975 is solved.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=C30F634301868B834CE2977E65E6B2DE&yid=0702FE8EC3581E51&vid=5D311CA918CA9A03&iid=E158A972A605785F&sid=4B168891B5E5FB30&eid=3622B70F9C54A9CC&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0