Augmented tranśition networks and their relation to tree transducers☆

https://doi.org/10.1016/0020-0255(76)90006-2Get rights and content

Abstract

Augmented Transition Network Parsers (ATN) were defined by Woods and used by him in a natural language understanding system. Every recursively enumerable set is recognizable by an ATN.

We define the Basic ATN, a limited class of ATN, and show that the languages accepted by this class are exactly those generated by a single top-down finite-state tree transducer, as defined by Rounds and Thatcher. These languages are known to be context-sensitive but have an NP-complete recognition problem.

References (30)

  • J. Engelfriet, Bottom-up and Top-down Tree Transformations—A Comparison, Math Systems Theory 9,...
  • M.J. Fischer

    Grammars with macro-like productions

  • S. Ginsburg

    The Mathematical Theory of Context-Free Languages

    (1966)
  • S. Gorn

    Explicit definitions and linguistic dominoes

  • T. Hayashi

    On derivation trees of indexed grammars—an extension of the uvwxy-theorem

    Publications of the Research Institute for Mathematical Sciences, Kyoto University

    (1973)

    • Cited by (0)

    ☆

    This work was supported in part by the National Science Foundation under Grant GS-31309, and by the National Research Council of Canada under Grant A-9285.

    View full text
    Copyright © 1976 Published by Elsevier Inc.