• DocumentCode
    2178348
  • Title

    The unsolvability of the equivalence problem for e-free NGSM´s with unary input (output) alphabet and applications

  • Author

    Ibarra, Oscar H.

  • fYear
    1977
  • fDate
    Oct. 31 1977-Nov. 2 1977
  • Firstpage
    74
  • Lastpage
    81
  • Abstract
    It is shown that the equivalence problem is unsolvable for ε-free nondeterministic generalized sequential machines whose input/output are restricted to unary/binary (binary/unary) alphabets. This strengthens a known result of Griffiths. Applications to some decision problems concerning right-linear grammars and directed graphs are also given.
  • Keywords
    Application software; Computer science; Transducers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1977., 18th Annual Symposium on
  • Conference_Location
    Providence, RI, USA
  • ISSN
    0272-5428
  • Type

    conf

  • DOI
    10.1109/SFCS.1977.35
  • Filename
    4567927
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2178348