{"id":"https://openalex.org/W2030683615","doi":"https://doi.org/10.1109/tc.1980.1675655","title":"A Method for Minimizing Incompletely Specified Sequential Machines","display_name":"A Method for Minimizing Incompletely Specified Sequential Machines","publication_year":1980,"publication_date":"1980-08-01","ids":{"openalex":"https://openalex.org/W2030683615","doi":"https://doi.org/10.1109/tc.1980.1675655","mag":"2030683615"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1980.1675655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1980.1675655","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5071256887","display_name":"Y. Yamamoto","orcid":"https://orcid.org/0000-0002-4150-6804"},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yamamoto","raw_affiliation_strings":["Department of Management Engineering, Nagoya Institute of Technology, Nagoya, Japan","Department of Management Engineering, Nagoya Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Department of Management Engineering, Nagoya Institute of Technology, Nagoya, Japan","institution_ids":["https://openalex.org/I197274945"]},{"raw_affiliation_string":"Department of Management Engineering, Nagoya Institute of Technology","institution_ids":["https://openalex.org/I197274945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071256887"],"corresponding_institution_ids":["https://openalex.org/I197274945"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.18491759,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"C-29","issue":"8","first_page":"732","last_page":"736"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9897000193595886,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9897000193595886,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9894000291824341,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/erasure","display_name":"Erasure","score":0.6702884435653687},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5663878917694092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5615466237068176},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4969814121723175},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.495006263256073},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4862188398838043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46617865562438965},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4123965799808502},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41224706172943115},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4118436574935913},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4102206528186798},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23108002543449402},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.121235191822052}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6702884435653687},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5663878917694092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5615466237068176},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4969814121723175},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.495006263256073},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4862188398838043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46617865562438965},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4123965799808502},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41224706172943115},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4118436574935913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4102206528186798},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23108002543449402},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.121235191822052},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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.1109/tc.1980.1675655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1980.1675655","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1967738867","https://openalex.org/W1969485190","https://openalex.org/W1993233904","https://openalex.org/W1997745287","https://openalex.org/W2033724727","https://openalex.org/W2063111778","https://openalex.org/W2098467469","https://openalex.org/W2110447914","https://openalex.org/W2145003588","https://openalex.org/W2152605746","https://openalex.org/W4232645518"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W3164774158","https://openalex.org/W2372211403","https://openalex.org/W4297817344","https://openalex.org/W1498463151"],"abstract_inverted_index":{"After":[0],"Paull":[1],"and":[2,19,130],"Unger":[3],"introduced":[4],"the":[5,65,83,89,106,119,123,134,139],"problem":[6],"of":[7,42,48,67,78,82,99,108,122,126],"state":[8,120],"minimization":[9],"in":[10,137],"incompletely":[11],"specified":[12],"sequential":[13],"machines":[14],"(ISSM's),":[15],"its":[16],"increasing":[17],"importance":[18],"complexity":[20],"induced":[21],"many":[22],"people":[23],"to":[24,28,55,74,94],"continue":[25],"research":[26],"related":[27],"this":[29],"field.":[30],"Here":[31],"we":[32,63,112],"shall":[33],"present":[34],"a":[35,39,43,49,60,70,96,100,115,127],"method":[36],"for":[37,59,118],"obtaining":[38],"minimum":[40,61,97,124],"form":[41,98,125],"given":[44,101,128],"ISSM":[45],"by":[46,104],"application":[47],"directed":[50,90,140],"tree":[51,91,141],"graph.":[52,142],"In":[53],"order":[54],"save":[56],"counting":[57],"effort":[58],"form,":[62],"extend":[64],"concept":[66,107],"erasure":[68,85],"from":[69],"relation":[71],"between":[72,76],"compatibles":[73],"one":[75],"subsets":[77],"compatibles.":[79],"The":[80],"use":[81],"extended":[84],"rules":[86],"can":[87,113],"prune":[88],"graph":[92],"effectively":[93,132],"find":[95],"ISSM.":[102],"Furthermore,":[103],"utilizing":[105],"maximal":[109],"incompatible":[110],"(MI)":[111],"determine":[114],"lower":[116],"bound":[117],"number":[121],"ISSM,":[129],"also":[131],"control":[133],"initial":[135],"steps":[136],"generating":[138]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}