Decision Problems in Automata Theory
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Dana S. Richards', 'PO_EMAI': None, 'PO_PHON': None}
The equivalence problems for various types of finite transducers,               pushdown automata, and pushdown transducers are being investigated.             The research being done on these problems is expected to contribute to          the eventual solution of the famous equivalence problem for                     deterministic pushdown automata.  Two entirely different techniques for         proving the decidability of equivalence problems are being used.  The           first one, called the "test-set approach" has already been successfully         applied: the principal investigator in collaboration with J. Karhumaki          used it to solve the (previously open) equivalence problem for two              classes of finite transducers.  The second method based on the                  "synchronizability conjecture" is intended for DPDAs and deterministic          pushdown transducers.                                                                                                                                           The PI is also continuing his investigations in cellular automata and           systolic systems.                                                                                                                                               The PI is a leading world figure in the solving of difficult                    decidability questions.  He has recently produced solutions to related          problems and is as likely as anyone to solve the difficult problems             proposed.
{'FirstName': 'Karel', 'LastName': 'Culik', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Karel Culik', 'EmailAddress': 'culik@cs.sc.edu', 'NSF_ID': '000257715', 'StartDate': '09/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of South Carolina at Columbia', 'CityName': 'COLUMBIA', 'ZipCode': '292083403', 'PhoneNumber': '8037777093', 'StreetAddress': '1600 HAMPTON ST', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'South Carolina', 'StateCode': 'SC', 'CONGRESSDISTRICT': '06', 'CONGRESS_DISTRICT_ORG': 'SC06', 'ORG_UEI_NUM': 'J22LNTMEDP73', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF SOUTH CAROLINA', 'ORG_PRNT_UEI_NUM': 'J22LNTMEDP73'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '2860', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8702752.xml'}