• DocumentCode
    1116708
  • Title

    Equivalence and Reduction of Expansive Tree Grammars

  • Author

    Barrero, A. ; Gonzalez, R.C. ; Thomason, M.G.

  • Author_Institution
    Department of Electrical Engineering, University of Tennessee, Knoxville, TN 37916.
  • Issue
    2
  • fYear
    1981
  • fDate
    3/1/1981 12:00:00 AM
  • Firstpage
    204
  • Lastpage
    206
  • Abstract
    The equivalence of nonterminals of an expansive tree grammar is considered. Algorithms are presented for constructing sets of equivalent nonterminals for an expansive tree grammar, for reducing the grammar, and for determining whether two grammars generate the same language.
  • Keywords
    Automata; Computer science; Pattern recognition; Production; Vegetation mapping; Algorithm; equivalence; expansive tree grammar; nonterminal; reduction; syntactic pattern recognition;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

  • DOI
    10.1109/TPAMI.1981.4767080
  • Filename
    4767080
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1116708