FINITE-STATE UNIFICATION AUTOMATA AND RELATIONAL LANGUAGES

被引：17
|
作者：
SHEMESH, Y
FRANCEZ, N
机构：
[1] Computer Science Department, Technion-Israel Institute of Technology
来源：
INFORMATION AND COMPUTATION | 1994年 / 114卷 / 02期
关键词：
D O I：
10.1006/inco.1994.1085
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We define the new notion of a (finite-state) unification automaton, a device for finite-state recognition of relational languages by means of unification transitions. Words in such a language are formed by composing base relations, and have the general form r(i1)(x(j1), x(k1))...r(in)(x(jn), x(kn)) for some n. Generation of such languages by regarding Horn clauses as grammers has been considered before, but to the best of our knowledge, recognizing such languages by suitably designed automata is a new approach. The main result presented is a pumping lemma, forming a necessary condition for finite-state recognizability. Some example results about such automata are given. (C) 1994 Academic Press, Inc.
引用
收藏
页码：192 / 213
页数：22
相关论文
共 50 条
12345