{"id":"https://openalex.org/W2066201500","doi":"https://doi.org/10.1137/0211013","title":"A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors","display_name":"A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors","publication_year":1982,"publication_date":"1982-02-01","ids":{"openalex":"https://openalex.org/W2066201500","doi":"https://doi.org/10.1137/0211013","mag":"2066201500"},"language":"en","primary_location":{"id":"doi:10.1137/0211013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211013","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031287630","display_name":"Emily P. Friedman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. P. Friedman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5018818128","display_name":"Sheila A. Greibach","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. A. Greibach","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031287630"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0707,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.77196837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"1","first_page":"166","last_page":"183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6903941631317139},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6757499575614929},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6675765514373779},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6153217554092407},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5599011182785034},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5561316609382629},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5543095469474792},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5011639595031738},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4885174036026001},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48178359866142273},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47851836681365967},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46491605043411255},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.43105342984199524},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4172438979148865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21280819177627563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14960575103759766},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06601548194885254}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6903941631317139},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6757499575614929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6675765514373779},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6153217554092407},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5599011182785034},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5561316609382629},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5543095469474792},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5011639595031738},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4885174036026001},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48178359866142273},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47851836681365967},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46491605043411255},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43105342984199524},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4172438979148865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21280819177627563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14960575103759766},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06601548194885254},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0211013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211013","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1981523035","https://openalex.org/W1986635205","https://openalex.org/W2005456631","https://openalex.org/W2024987067","https://openalex.org/W2054801208"],"related_works":["https://openalex.org/W2990853482","https://openalex.org/W2374430960","https://openalex.org/W2327776271","https://openalex.org/W2041069649","https://openalex.org/W2047754121","https://openalex.org/W2461808546","https://openalex.org/W2045590835","https://openalex.org/W2086025566","https://openalex.org/W1589381382","https://openalex.org/W2066201500"],"abstract_inverted_index":{"The":[0],"equivalence":[1,39],"problem":[2,15],"for":[3,37],"the":[4,14,56,59,64],"class":[5],"of":[6,16,58],"one-way":[7],"deterministic":[8],"2-tape":[9],"finite":[10],"state":[11],"acceptors":[12],"is":[13,40,50,55,77],"deciding":[17,38],"\u201c$L(M_1":[18],")":[19],"=":[20],"L(M_2":[21],")$\u201d,":[22],"where":[23,48,75],"$M_1":[24],"$":[25,28],"and":[26,53],"$M_2":[27],"are":[29],"machines":[30],"in":[31],"this":[32],"class.":[33],"A":[34],"new":[35],"algorithm":[36],"provided,":[41],"having":[42,70],"time":[43],"complexity":[44],"proportional":[45],"to":[46],"$p(n)$,":[47],"p":[49],"a":[51,78],"polynomial":[52],"n":[54],"size":[57],"machines.":[60],"This":[61],"improves":[62],"upon":[63],"best":[65],"previously":[66],"known":[67],"upper":[68],"bound":[69],"order":[71],"$2^{cn^6":[72],"}":[73],"$,":[74],"c":[76],"constant":[79],"[C.":[80],"Beeri,":[81],"Theoret.":[82],"Comput.":[83],"Sci.,":[84],"3":[85],"(1976),":[86],"pp.":[87],"305\u2013320].":[88]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}