@article{SHEMESH1994192,
    Abstract = {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 ri1(xj1, xk1)···rin(xjn, xkn) 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.},
    Author = {Shemesh, Y. and Francez, N.},
    File = {Finite-State Unification Automata and Relational Languages - 1-s2.0-S0890540184710856-main.pdf},
    ISSN = {0890-5401},
    Journal = {Information and Computation},
    Number = {2},
    Pages = {192-213},
    Title = {Finite-State Unification Automata and Relational Languages},
    URL = {https://www.sciencedirect.com/science/article/pii/S0890540184710856},
    Volume = {114},
    Year = {1994},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0890540184710856},
    bdsk-url-2 = {https://doi.org/10.1006/inco.1994.1085},
    date-added = {2021-04-07 14:19:37 +0200},
    date-modified = {2021-04-07 14:19:37 +0200},
    doi = {10.1006/inco.1994.1085}
}

@article{SHEMESH1994192, Abstract = {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 ri1(xj1, xk1)···rin(xjn, xkn) 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.}, Author = {Shemesh, Y. and Francez, N.}, File = {Finite-State Unification Automata and Relational Languages - 1-s2.0-S0890540184710856-main.pdf}, ISSN = {0890-5401}, Journal = {Information and Computation}, Number = {2}, Pages = {192-213}, Title = {Finite-State Unification Automata and Relational Languages}, URL = {https://www.sciencedirect.com/science/article/pii/S0890540184710856}, Volume = {114}, Year = {1994}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0890540184710856}, bdsk-url-2 = {https://doi.org/10.1006/inco.1994.1085}, date-added = {2021-04-07 14:19:37 +0200}, date-modified = {2021-04-07 14:19:37 +0200}, doi = {10.1006/inco.1994.1085} }