{"id":"https://openalex.org/W136845799","doi":"https://doi.org/10.25596/jalc-2002-469","title":"On the Number of Distinct Languages Accepted by Finite Automata with n States","display_name":"On the Number of Distinct Languages Accepted by Finite Automata with n States","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W136845799","doi":"https://doi.org/10.25596/jalc-2002-469","mag":"136845799"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.2838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.2838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~shallit/Papers/enum.ps","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.25596/jalc-2002-469","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002321933","display_name":"Michael Domaratzki","orcid":"https://orcid.org/0000-0001-9129-6676"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Domaratzki, Michael","raw_affiliation_strings":["School of Computer Science, Queen's University, Kingston, ON KTL 3N6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Queen's University, Kingston, ON KTL 3N6, Canada","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025356214","display_name":"Derek Kisman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kisman, Derek","raw_affiliation_strings":["5760 Buckboard Rd. NW, Calgary, AB T3A 4R6, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"5760 Buckboard Rd. NW, Calgary, AB T3A 4R6, Canada#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065322269","display_name":"Jeffrey Shallit","orcid":"https://orcid.org/0000-0003-1197-3820"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Shallit, Jeffrey","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, ON\u00a0N2L 3G1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, ON\u00a0N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7666,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.94863222,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"7","issue":"4","first_page":"469","last_page":"486"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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.9980000257492065,"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.9976000189781189,"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/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.768840491771698},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6719805002212524},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6529862284660339},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6307241916656494},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5179123282432556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5176640152931213},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5126684904098511},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5120618939399719},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.49720051884651184},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.4632803797721863},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43860742449760437},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4106150269508362},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.39850062131881714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3110257685184479},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1959911286830902},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17338824272155762},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.0643739104270935}],"concepts":[{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.768840491771698},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6719805002212524},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6529862284660339},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6307241916656494},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5179123282432556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5176640152931213},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5126684904098511},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5120618939399719},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.49720051884651184},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.4632803797721863},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43860742449760437},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4106150269508362},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.39850062131881714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3110257685184479},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1959911286830902},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17338824272155762},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0643739104270935},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.2838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.2838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/~shallit/Papers/enum.ps","raw_type":"text"},{"id":"doi:10.25596/jalc-2002-469","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-469","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":null,"raw_type":"article-journal"},{"id":"mag:136845799","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.25596/jalc-2002-469","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-469","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":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.6700000166893005,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W120113369","https://openalex.org/W204907918","https://openalex.org/W1480319329","https://openalex.org/W1501943875","https://openalex.org/W1519163652","https://openalex.org/W1964171103","https://openalex.org/W1969367179","https://openalex.org/W1979801752","https://openalex.org/W1995354328","https://openalex.org/W2002089154","https://openalex.org/W2005052659","https://openalex.org/W2054210322","https://openalex.org/W2059993753","https://openalex.org/W2062855758","https://openalex.org/W2073164965","https://openalex.org/W2073965964","https://openalex.org/W2079515284","https://openalex.org/W2332168526"],"related_works":["https://openalex.org/W2013433986","https://openalex.org/W2002089154","https://openalex.org/W1969958990","https://openalex.org/W2464982787","https://openalex.org/W3007371938","https://openalex.org/W22738309","https://openalex.org/W2062855758","https://openalex.org/W2056679539","https://openalex.org/W2913383557","https://openalex.org/W2332168526","https://openalex.org/W1994584977","https://openalex.org/W2404583597","https://openalex.org/W2090028629","https://openalex.org/W1519163652","https://openalex.org/W2340541605","https://openalex.org/W2619559442","https://openalex.org/W128863358","https://openalex.org/W1851980922","https://openalex.org/W2073164965","https://openalex.org/W2006629323"],"abstract_inverted_index":{"We":[0],"give":[1],"asymptotic":[2],"estimates":[3],"and":[4,15],"some":[5],"explicit":[6],"computations":[7],"for":[8],"both":[9],"the":[10,16],"number":[11,17],"of":[12,18],"distinct":[13,19],"languages":[14,21],"finite":[20,31,35],"over":[22],"a":[23],"$k$-letter":[24],"alphabet":[25],"that":[26],"are":[27],"accepted":[28],"by":[29],"deterministic":[30],"automata":[32],"(resp.":[33],"nondeterministic":[34],"automata)":[36],"with":[37],"$n$":[38],"states.":[39]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}