{"id":"https://openalex.org/W2527137011","doi":"https://doi.org/10.1007/978-3-319-53733-7_18","title":"Finding DFAs with Maximal Shortest Synchronizing Word Length","display_name":"Finding DFAs with Maximal Shortest Synchronizing Word Length","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2527137011","doi":"https://doi.org/10.1007/978-3-319-53733-7_18","mag":"2527137011"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-53733-7_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53733-7_18","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":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2066/173189","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074680417","display_name":"Henk Don","orcid":"https://orcid.org/0000-0002-3810-2884"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Henk Don","raw_affiliation_strings":["Radboud University Nijmegen, P.O. Box 9010, 6500 GL, Nijmegen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Radboud University Nijmegen, P.O. Box 9010, 6500 GL, Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080214204","display_name":"Hans Zantema","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]},{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Hans Zantema","raw_affiliation_strings":["Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","Radboud University Nijmegen, P.O. Box 9010, 6500 GL, Nijmegen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Radboud University Nijmegen, P.O. Box 9010, 6500 GL, Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080214204"],"corresponding_institution_ids":["https://openalex.org/I145872427","https://openalex.org/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.806,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.95122414,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"260"},"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.998199999332428,"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/T12029","display_name":"DNA and Biological Computing","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/synchronizing","display_name":"Synchronizing","score":0.8799525499343872},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6373010873794556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6299120187759399},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5312274098396301},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.46281492710113525},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.4608757793903351},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44518136978149414},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4313291907310486},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.42698320746421814},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3391817808151245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2979337275028229},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.17321595549583435}],"concepts":[{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.8799525499343872},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6373010873794556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6299120187759399},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5312274098396301},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.46281492710113525},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.4608757793903351},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44518136978149414},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4313291907310486},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.42698320746421814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3391817808151245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2979337275028229},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.17321595549583435},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-319-53733-7_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53733-7_18","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/c56acb2c-be62-4c95-a36e-66fbaca55171","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/c56acb2c-be62-4c95-a36e-66fbaca55171","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":"Zantema, H & Don, H 2017, Finding DFAs with maximal shortest synchronizing word length. in F Drewes, C Mart\u00edn-Vide & B Truthe (eds), Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings : 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. 249-260. https://doi.org/10.1007/978-3-319-53733-7_18","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:ru:oai:repository.ubn.ru.nl:2066/173189","is_oa":true,"landing_page_url":"http://hdl.handle.net/2066/173189","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Drewes, F.; Mart\u00edn-Vide, C.; Truthe, B. (ed.), Language and Automata Theory and Applications: 11th International Conference, LATA 2017, Ume\u00e5, Sweden, March 6-9, 2017, Proceedings, 249 - 260. Cham : Springer International Publishing","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/c56acb2c-be62-4c95-a36e-66fbaca55171","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/c56acb2c-be62-4c95-a36e-66fbaca55171","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, Proceedings: 11th International Conference, LATA 2017, Ume\u00e5, Sweden, March 6-9, 2017, Proceedings, 249 - 260","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:ru:oai:repository.ubn.ru.nl:2066/173189","is_oa":true,"landing_page_url":"http://hdl.handle.net/2066/173189","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Drewes, F.; Mart\u00edn-Vide, C.; Truthe, B. (ed.), Language and Automata Theory and Applications: 11th International Conference, LATA 2017, Ume\u00e5, Sweden, March 6-9, 2017, Proceedings, 249 - 260. Cham : Springer International Publishing","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W70860197","https://openalex.org/W1207259902","https://openalex.org/W1991980356","https://openalex.org/W2034962669","https://openalex.org/W2037900755","https://openalex.org/W2079502209","https://openalex.org/W2106446429","https://openalex.org/W2122803069","https://openalex.org/W2171278552","https://openalex.org/W2283323122","https://openalex.org/W2407909453","https://openalex.org/W2950084554","https://openalex.org/W2962940319","https://openalex.org/W2963544879"],"related_works":["https://openalex.org/W2359328895","https://openalex.org/W2363535981","https://openalex.org/W2007402811","https://openalex.org/W2326762630","https://openalex.org/W2391354408","https://openalex.org/W1986103452","https://openalex.org/W2166562438","https://openalex.org/W2388558702","https://openalex.org/W1982437410","https://openalex.org/W3088566498"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-10-07T00:00:00"}