|
|
系统科学与数学 1988
THE NONDETERMINISTIC FINITE AUTOMATON WHOSE GTB-FAMILY IS RECOGNIZABLE
|
Abstract:
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.
