{"id":"https://openalex.org/W2408033335","doi":"https://doi.org/10.25596/jalc-2010-053","title":"On the Shuffle Automaton Size for Words","display_name":"On the Shuffle Automaton Size for Words","publication_year":2009,"publication_date":"2009-07-29","ids":{"openalex":"https://openalex.org/W2408033335","doi":"https://doi.org/10.25596/jalc-2010-053","mag":"2408033335"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.313.9913","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.9913","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0907.5111v1.pdf","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.0907.5111","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007374049","display_name":"Franziska Biegler","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Biegler, Franziska","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059512715","display_name":"Mark Daley","orcid":"https://orcid.org/0000-0002-6939-9772"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daley, Mark","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5040385755","display_name":"Ian McQuillan","orcid":"https://orcid.org/0000-0002-7998-4430"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"McQuillan, Ian","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007374049"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3428,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.65898117,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":null,"first_page":"53","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9980999827384949,"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.9980999827384949,"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/T12029","display_name":"DNA and Biological Computing","score":0.9954000115394592,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9842000007629395,"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/quadratic-equation","display_name":"Quadratic equation","score":0.7469331622123718},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6865473985671997},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6645368933677673},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5838974714279175},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.56980961561203},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5571216344833374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5126141905784607},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4544118642807007},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4543520510196686},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4406895041465759},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4182385504245758},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3635447323322296},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31463903188705444},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21537461876869202}],"concepts":[{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.7469331622123718},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6865473985671997},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6645368933677673},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5838974714279175},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.56980961561203},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5571216344833374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5126141905784607},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4544118642807007},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4543520510196686},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4406895041465759},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4182385504245758},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3635447323322296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31463903188705444},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21537461876869202},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.313.9913","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.9913","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0907.5111v1.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.0907.5111","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0907.5111","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.25596/jalc-2010-053","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2010-053","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2408033335","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jalc/jalc15.html#BieglerDM10","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of automata, languages and combinatorics","raw_type":null}],"best_oa_location":{"id":"doi:10.48550/arxiv.0907.5111","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0907.5111","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2917430486","https://openalex.org/W2021596745","https://openalex.org/W2008734340","https://openalex.org/W3048326796","https://openalex.org/W1704463895","https://openalex.org/W811645096","https://openalex.org/W2750142210","https://openalex.org/W2752548843","https://openalex.org/W2803708003","https://openalex.org/W3104869282","https://openalex.org/W1554048570","https://openalex.org/W2020071688","https://openalex.org/W3043636834","https://openalex.org/W2898176033","https://openalex.org/W3100488283","https://openalex.org/W2955901052","https://openalex.org/W2402029802","https://openalex.org/W1875762977","https://openalex.org/W2787306511","https://openalex.org/W2885320505"],"abstract_inverted_index":{"We":[0,13,35],"investigate":[1],"the":[2,8,21,41,53,76],"state":[3,54],"size":[4,55],"of":[5,10,33,56,68],"DFAs":[6],"accepting":[7],"shuffle":[9],"two":[11,64],"words.":[12],"provide":[14],"words":[15,42],"u":[16,25,43,57,69],"and":[17,44],"v,":[18],"such":[19],"that":[20],"minimal":[22],"DFA":[23],"for":[24,40],"shuffled":[26,58],"with":[27,59],"v":[28,45,71],"requires":[29],"an":[30],"exponential":[31],"number":[32],"states.":[34],"also":[36],"show":[37],"some":[38],"conditions":[39],"which":[46],"ensure":[47],"a":[48],"quadratic":[49,79],"upper":[50],"bound":[51],"on":[52],"v.":[60],"Moreover,":[61],"switching":[62],"only":[63],"letters":[65],"within":[66],"one":[67],"or":[70],"is":[72],"enough":[73],"to":[74,80],"trigger":[75],"change":[77],"from":[78],"exponential.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}