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 条
  • [31] PRONUNCIATION MODELING Automatic Learning of Finite-state Automata
    Pastor, Moises
    Casacuberta, Francisco
    INTEGRATION OF PHONETIC KNOWLEDGE IN SPEECH TECHNOLOGY, 2005, 25 : 133 - 148
  • [32] An Approximate Determinization Algorithm for Weighted Finite-State Automata
    A. L. Buchsbaum
    R. Giancarlo
    J. R. Westbrook
    Algorithmica, 2001, 30 : 503 - 526
  • [33] Indistinguishability of finite-state automata with respect to some environments
    Kurganskii A.N.
    Cybernetics and Systems Analysis, 2001, 37 (1) : 33 - 41
  • [34] A GEOMETRICAL VIEW OF THE DETERMINIZATION AND MINIMIZATION OF FINITE-STATE AUTOMATA
    COURCELLE, B
    NIWINSKI, D
    PODELSKI, A
    MATHEMATICAL SYSTEMS THEORY, 1991, 24 (02): : 117 - 146
  • [35] On a Class of High-Level Finite-State Automata
    Vinogradov, R. A.
    Sokolov, V. A.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2010, 44 (07) : 398 - 406
  • [36] An Efficient Parallel Determinisation Algorithm for Finite-state Automata
    Hanneforth, Thomas
    Watson, Bruce W.
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012, 2012, : 42 - 52
  • [37] Methods of constructing universal tests for finite-state automata
    V. A. Tverdokhlebov
    Automation and Remote Control, 2005, 66 (1) : 139 - 147
  • [38] Shorter regular expressions from finite-state automata
    Han, YS
    Wood, D
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 141 - 152
  • [39] Compression of finite-state automata through failure transitions
    Bjorklund, Henrik
    Bjorklund, Johanna
    Zechner, Niklas
    THEORETICAL COMPUTER SCIENCE, 2014, 557 : 87 - 100
  • [40] Methods of constructing universal tests for finite-state automata
    Tverdokhlebov, VA
    AUTOMATION AND REMOTE CONTROL, 2005, 66 (01) : 139 - 147
12345