{"id":"https://openalex.org/W1489975931","doi":"https://doi.org/10.25596/jalc-2002-247","title":"The Computing Power of Programs over Finite Monoids","display_name":"The Computing Power of Programs over Finite Monoids","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1489975931","doi":"https://doi.org/10.25596/jalc-2002-247","mag":"1489975931"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.5854","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.5854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.mcgill.ca/~denis/papers/JALC-LAC.ps","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2002-247","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044226857","display_name":"Pascal Tesson","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Tesson, Pascal","raw_affiliation_strings":["School of Computer Science, McGill University, 3480 University, Montr\u00e9al, Qu\u00e9bec, H3A 2A7 Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, 3480 University, Montr\u00e9al, Qu\u00e9bec, H3A 2A7 Canada#TAB#","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000703561","display_name":"Denis Th\u00e9rien","orcid":"https://orcid.org/0000-0002-7545-909X"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Th\u00e9rien, Denis","raw_affiliation_strings":["School of Computer Science, McGill University, 3480 University, Montr\u00e9al, Qu\u00e9bec, H3A 2A7 Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, 3480 University, Montr\u00e9al, Qu\u00e9bec, H3A 2A7 Canada#TAB#","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044226857"],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.04237787,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"2","first_page":"247","last_page":"258"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9955000281333923,"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.9954000115394592,"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/monoid","display_name":"Monoid","score":0.8650680780410767},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.7275983095169067},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5960017442703247},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5774281024932861},{"id":"https://openalex.org/keywords/syntactic-monoid","display_name":"Syntactic monoid","score":0.5333195924758911},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.49517956376075745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46317416429519653},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4611987769603729},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.452581524848938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42235782742500305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3667454421520233},{"id":"https://openalex.org/keywords/free-monoid","display_name":"Free monoid","score":0.3647247552871704},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.35640597343444824},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.26495617628097534},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2364313304424286},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2289513349533081},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.08378693461418152}],"concepts":[{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.8650680780410767},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.7275983095169067},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5960017442703247},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5774281024932861},{"id":"https://openalex.org/C119903167","wikidata":"https://www.wikidata.org/wiki/Q3321297","display_name":"Syntactic monoid","level":4,"score":0.5333195924758911},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.49517956376075745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46317416429519653},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4611987769603729},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.452581524848938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42235782742500305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3667454421520233},{"id":"https://openalex.org/C149685015","wikidata":"https://www.wikidata.org/wiki/Q5500266","display_name":"Free monoid","level":3,"score":0.3647247552871704},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.35640597343444824},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.26495617628097534},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2364313304424286},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2289513349533081},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.08378693461418152},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.5854","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.5854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.mcgill.ca/~denis/papers/JALC-LAC.ps","raw_type":"text"},{"id":"doi:10.25596/jalc-2002-247","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-247","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:1489975931","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jalc/jalc7.html#TessonT02","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},{"id":"mag:3089845157","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc8.html#ECCC-TR01-005","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"doi:10.25596/jalc-2002-247","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-247","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":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1500453128","https://openalex.org/W1533648993","https://openalex.org/W1764454094","https://openalex.org/W2010465749","https://openalex.org/W2058707009","https://openalex.org/W2070678975","https://openalex.org/W2079162006","https://openalex.org/W2104952158","https://openalex.org/W2111132083"],"related_works":["https://openalex.org/W3089845157","https://openalex.org/W2104952158","https://openalex.org/W1517313330","https://openalex.org/W2543326081","https://openalex.org/W99865627","https://openalex.org/W2010465749","https://openalex.org/W1533648993","https://openalex.org/W2183347322","https://openalex.org/W1796835294","https://openalex.org/W2111380805","https://openalex.org/W2031779562","https://openalex.org/W2904842705","https://openalex.org/W2003587861","https://openalex.org/W2002757726","https://openalex.org/W1736615600","https://openalex.org/W2065930159","https://openalex.org/W2079179697","https://openalex.org/W1922826310","https://openalex.org/W2897518291","https://openalex.org/W2170097596"],"abstract_inverted_index":{"The":[0],"formalism":[1],"of":[2],"programs":[3],"over":[4],"monoids":[5],"has":[6],"been":[7],"studied":[8],"for":[9],"its":[10,57],"close":[11],"connection":[12],"to":[13,70,73],"parallel":[14],"complexity":[15],"classes":[16],"defined":[17],"by":[18],"small-depth":[19],"boolean":[20],"circuits.":[21],"We":[22],"investigate":[23],"two":[24,67],"basic":[25],"questions":[26],"about":[27],"this":[28],"model.":[29],"When":[30,49],"is":[31,47,50],"a":[32,51],"monoid":[33,52],"rich":[34],"enough":[35,54],"that":[36,55],"it":[37],"can":[38,59],"recognize":[39],"arbitrary":[40],"languages":[41],"(provided":[42],"no":[43],"restriction":[44],"on":[45],"length":[46],"imposed)?":[48],"weak":[53],"all":[56],"computations":[58],"be":[60,71],"realized":[61],"in":[62],"polynomial":[63],"length?":[64],"Surprisingly,":[65],"these":[66],"properties":[68],"appear":[69],"dual":[72],"each":[74],"other.":[75]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}