{"id":"https://openalex.org/W2588532775","doi":"https://doi.org/10.1007/978-3-319-53733-7_16","title":"Minimization of Finite State Automata Through Partition Aggregation","display_name":"Minimization of Finite State Automata Through Partition Aggregation","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2588532775","doi":"https://doi.org/10.1007/978-3-319-53733-7_16","mag":"2588532775"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-53733-7_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53733-7_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5026629742","display_name":"Johanna Bj\u00f6rklund","orcid":"https://orcid.org/0000-0003-0596-627X"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Johanna Bj\u00f6rklund","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 University, Ume\u00e5, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 University, Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043799147","display_name":"Loek Cleophas","orcid":"https://orcid.org/0000-0002-7221-3676"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]},{"id":"https://openalex.org/I26092322","display_name":"Stellenbosch University","ror":"https://ror.org/05bk57929","country_code":"ZA","type":"education","lineage":["https://openalex.org/I26092322"]}],"countries":["SE","ZA"],"is_corresponding":false,"raw_author_name":"Loek Cleophas","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 University, Ume\u00e5, Sweden","Department of Information Science, Stellenbosch University, Stellenbosch, South Africa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 University, Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]},{"raw_affiliation_string":"Department of Information Science, Stellenbosch University, Stellenbosch, South Africa","institution_ids":["https://openalex.org/I26092322"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026629742"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5312,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60410334,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"223","last_page":"235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7859151363372803},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.7253382802009583},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7151243090629578},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.7019503712654114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5618600845336914},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5616106986999512},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5424225926399231},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.48767197132110596},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.45140066742897034},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.45036953687667847},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4401733875274658},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.4312080442905426},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4286215305328369},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4235297441482544},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.4138137102127075},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3971622884273529},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34611791372299194},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34130269289016724},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26852256059646606},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1980067789554596}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7859151363372803},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7253382802009583},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7151243090629578},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.7019503712654114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5618600845336914},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5616106986999512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5424225926399231},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.48767197132110596},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.45140066742897034},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.45036953687667847},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4401733875274658},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.4312080442905426},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4286215305328369},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4235297441482544},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.4138137102127075},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3971622884273529},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34611791372299194},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34130269289016724},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26852256059646606},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1980067789554596},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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":11,"locations":[{"id":"doi:10.1007/978-3-319-53733-7_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53733-7_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/e401f671-b5b7-4385-8b42-71595681e4a0","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e401f671-b5b7-4385-8b42-71595681e4a0","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bj\u00f6rklund, J & Cleophas, L G W A 2017, Minimization of finite state automata through partition aggregation. in F Drewes, C Mart\u00edn-Vide & B Truthe (eds), Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Ume\u00e5, Sweden, March 6-9, 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10168 LNCS, Springer, Dordrecht, pp. 223-235. https://doi.org/10.1007/978-3-319-53733-7_16","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:868336","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=868336","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:879977","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=879977","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:882011","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=882011","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISBN:978-3-662-53825-8","raw_type":"Part of book or chapter of book"},{"id":"pmh:oai:library.tue.nl:864799","is_oa":false,"landing_page_url":"http://repository.tue.nl/864799","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISBN:978-3-662-53825-8","raw_type":"Part of book or chapter of book"},{"id":"pmh:oai:library.tue.nl:868336","is_oa":false,"landing_page_url":"http://repository.tue.nl/868336","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:879977","is_oa":false,"landing_page_url":"http://repository.tue.nl/879977","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:882011","is_oa":false,"landing_page_url":"http://repository.tue.nl/882011","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISBN:978-3-662-53825-8","raw_type":"Part of book or chapter of book"},{"id":"pmh:oai:pure.tue.nl:publications/e401f671-b5b7-4385-8b42-71595681e4a0","is_oa":false,"landing_page_url":"http://www.mendeley.com/research/minimization-finite-state-automata-through-partition-aggregation","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bj\u00f6rklund, J & Cleophas, L G W A 2017, Minimization of finite state automata through partition aggregation. in F Drewes, C Mart\u00edn-Vide & B Truthe (eds), Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Ume\u00e5, Sweden, March 6-9, 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10168 LNCS, Springer, Dordrecht, pp. 223-235. https://doi.org/10.1007/978-3-319-53733-7_16","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/e401f671-b5b7-4385-8b42-71595681e4a0","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/e401f671-b5b7-4385-8b42-71595681e4a0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Language and Automata Theory and Applications: 11th International Conference, LATA 2017, Ume\u00e5, Sweden, March 6-9, 2017, Proceedings, 223 - 235","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1495751652","https://openalex.org/W1513471057","https://openalex.org/W1655990431","https://openalex.org/W1926676550","https://openalex.org/W1969148345","https://openalex.org/W1979603834","https://openalex.org/W1986022261","https://openalex.org/W2007464118","https://openalex.org/W2068361557","https://openalex.org/W2075690166","https://openalex.org/W2088432971","https://openalex.org/W2089409100","https://openalex.org/W2089904802","https://openalex.org/W2100600029","https://openalex.org/W2102351893","https://openalex.org/W2114998520","https://openalex.org/W2122493035","https://openalex.org/W2137012751","https://openalex.org/W2155765172","https://openalex.org/W2493256084","https://openalex.org/W3177082579"],"related_works":["https://openalex.org/W2810776027","https://openalex.org/W2003664089","https://openalex.org/W2136740376","https://openalex.org/W2037872771","https://openalex.org/W2243509623","https://openalex.org/W1983100634","https://openalex.org/W185868636","https://openalex.org/W72746997","https://openalex.org/W2772918710","https://openalex.org/W2118296037"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-02T08:42:23.175194","created_date":"2025-10-10T00:00:00"}