• DocumentCode
    1115498
  • Title

    Some Decision Problems for Bottom-Up Triangle Acceptors

  • Author

    Nakamura, Akira

  • Author_Institution
    Department of Applied Mathematics, Hiroshima University, Hiroshima, Japan; Computer Science Center, University of Maryland, College Park, MD 20742.
  • Issue
    4
  • fYear
    1979
  • Firstpage
    415
  • Lastpage
    417
  • Abstract
    It is proved that the emptiness problem for deterministic bottom-up triangle acceptors (BTA´s) over a single input symbol is recursively unsolvable. From this result, it is also shown that certain decision problems involving BTA´s and BPA´s (deterministic bottom-up pyramid acceptors) are unsolvable.
  • Keywords
    Brightness; Density functional theory; Distribution functions; Histograms; Humans; Image enhancement; Information theory; Radar applications; Radar imaging; Radar theory; Cellular automata; formal languages; undecidability;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

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