{"id":"https://openalex.org/W2043641704","doi":"https://doi.org/10.1137/s0097539793249530","title":"Finite Monoids: From Word to Circuit Evaluation","display_name":"Finite Monoids: From Word to Circuit Evaluation","publication_year":1997,"publication_date":"1997-02-01","ids":{"openalex":"https://openalex.org/W2043641704","doi":"https://doi.org/10.1137/s0097539793249530","mag":"2043641704"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793249530","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793249530","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5111422440","display_name":"Martin Beaudry","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Martin Beaudry","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039352699","display_name":"Pierre McKenzie","orcid":"https://orcid.org/0000-0002-2483-8305"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pierre McKenzie","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049721291","display_name":"Pierre P\u00e9ladeau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pierre P\u00e9ladeau","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000703561","display_name":"Denis Th\u00e9rien","orcid":"https://orcid.org/0000-0002-7545-909X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Denis Th\u00e9rien","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111422440"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.17366464,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"26","issue":"1","first_page":"138","last_page":"152"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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.9976000189781189,"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/monoid","display_name":"Monoid","score":0.9249664545059204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7486386299133301},{"id":"https://openalex.org/keywords/aperiodic-graph","display_name":"Aperiodic graph","score":0.5874189734458923},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5605912208557129},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5355655550956726},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5302144289016724},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5057699680328369},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5040170550346375},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.49389415979385376},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.49223795533180237},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4853922128677368},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4671066999435425},{"id":"https://openalex.org/keywords/word-problem","display_name":"Word problem (mathematics education)","score":0.4493449628353119},{"id":"https://openalex.org/keywords/nilpotent","display_name":"Nilpotent","score":0.4375185966491699},{"id":"https://openalex.org/keywords/algebraic-structure","display_name":"Algebraic structure","score":0.4201587736606598},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.41841816902160645},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.3342599868774414},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3072888255119324},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2659383714199066},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2480233907699585},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16013580560684204},{"id":"https://openalex.org/keywords/law","display_name":"Law","score":0.08437240123748779}],"concepts":[{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.9249664545059204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7486386299133301},{"id":"https://openalex.org/C104247578","wikidata":"https://www.wikidata.org/wiki/Q4779368","display_name":"Aperiodic graph","level":2,"score":0.5874189734458923},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5605912208557129},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5355655550956726},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5302144289016724},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5057699680328369},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5040170550346375},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.49389415979385376},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.49223795533180237},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4853922128677368},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4671066999435425},{"id":"https://openalex.org/C90988201","wikidata":"https://www.wikidata.org/wiki/Q255912","display_name":"Word problem (mathematics education)","level":2,"score":0.4493449628353119},{"id":"https://openalex.org/C50555996","wikidata":"https://www.wikidata.org/wiki/Q840023","display_name":"Nilpotent","level":2,"score":0.4375185966491699},{"id":"https://openalex.org/C182419690","wikidata":"https://www.wikidata.org/wiki/Q205464","display_name":"Algebraic structure","level":2,"score":0.4201587736606598},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.41841816902160645},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.3342599868774414},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3072888255119324},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2659383714199066},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2480233907699585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16013580560684204},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.08437240123748779},{"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/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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":2,"locations":[{"id":"doi:10.1137/s0097539793249530","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793249530","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.3830","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.3830","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/circuiteval.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1500453128","https://openalex.org/W1984509356","https://openalex.org/W1990870868","https://openalex.org/W2010465749","https://openalex.org/W2012539169","https://openalex.org/W2019522567","https://openalex.org/W2021238854","https://openalex.org/W2027501230","https://openalex.org/W2030035159","https://openalex.org/W2043360684","https://openalex.org/W2045171534","https://openalex.org/W2045583484","https://openalex.org/W2056330738","https://openalex.org/W2061033459","https://openalex.org/W2061489447","https://openalex.org/W2068638452","https://openalex.org/W2073409415","https://openalex.org/W2077543142","https://openalex.org/W2080456897","https://openalex.org/W2088956149","https://openalex.org/W2111132083","https://openalex.org/W2175195593","https://openalex.org/W4240781210"],"related_works":["https://openalex.org/W1511851241","https://openalex.org/W2130856794","https://openalex.org/W1523052313","https://openalex.org/W1975351486","https://openalex.org/W1492906489","https://openalex.org/W3106811412","https://openalex.org/W2079333248","https://openalex.org/W1978362621","https://openalex.org/W23960441","https://openalex.org/W2058817145"],"abstract_inverted_index":{"The":[0],"problem":[1,29,161],"of":[2,30,47,66,82,104,128,138,177,180,188],"evaluating":[3,31,59],"a":[4,11,23,32,165],"circuit":[5,77,111],"whose":[6,16],"wires":[7],"carry":[8],"values":[9],"from":[10],"finite":[12],"monoid":[13,20,85],"M":[14],"and":[15,52,63,171],"gates":[17],"perform":[18],"the":[19,27,44,48,64,67,80,102,124,129,136,141,154,160,173,185],"operation":[21],"provides":[22],"meaningful":[24],"generalization":[25],"to":[26,43,184],"well-studied":[28],"word":[33],"over":[34,38,61,91,140],"M.":[35],"Evaluating":[36],"words":[37],"monoids":[39,62,93,106],"is":[40,74,86,107,133,151,167],"closely":[41],"tied":[42],"fine":[45],"structure":[46,65],"complexity":[49,68],"class":[50,69,157],"$NC^1$,":[51],"in":[53,79,97,116],"this":[54],"paper":[55],"analogous":[56],"ties":[57],"between":[58],"circuits":[60,90,139],"P":[70,87],"are":[71,114],"exhibited.":[72],"It":[73],"shown":[75,134],"that":[76,135,159,172],"evaluation":[78,112,137],"case":[81,103,176],"any":[83],"nonsolvable":[84],"complete,":[88],"while":[89],"solvable":[92],"can":[94],"be":[95],"evaluated":[96],"$DET":[98],"\\subseteq":[99],"NC^2$.":[100],"Then":[101],"aperiodic":[105],"completely":[108],"elucidated:":[109],"their":[110],"problems":[113],"either":[115],"$AC^0$":[117],"or":[118,120],"L-":[119],"$NL$-complete,":[121],"depending":[122],"on":[123],"precise":[125],"algebraic":[126],"properties":[127],"monoids.":[130],"Finally,":[131],"it":[132],"cyclic":[142],"group":[143],"${\\Bbb":[144],"Z}_q$":[145],"for":[146,153,162,169],"fixed":[147],"$q":[148],"\\geq":[149],"2$":[150],"complete":[152,168],"logspace":[155],"counting":[156],"$co$-$MOD_qL$,":[158],"p-groups":[163],"(p":[164],"prime)":[166],"$MOD_pL$,":[170],"more":[174],"general":[175],"nilpotent":[178],"groups":[179],"exponent":[181],"q":[182],"belongs":[183],"Boolean":[186],"closure":[187],"$MOD_qL$.":[189]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}