We show how appropriately chosen functions which we call distinguishing can be used to make deterministic finite automata backward deterministic. These ideas can be exploited to design regular language classes identifiable in the limit from positive samples. Special cases of this approach are the k-reversible and terminal distinguishable languages as discussed in [1,8,10,17,18].
展开▼
机译：We show how appropriately chosen functions which we call distinguishing can be used to make deterministic finite automata backward deterministic.这些想法可以被利用来设计常规语言类识别的常规样本中的限制。这种方法的特殊情况是[1,8,10,17,18]中讨论的K-Reversible和终端可区分语言。
展开▼
