{"id":"https://openalex.org/W1490895920","doi":"https://doi.org/10.25596/jalc-2002-419","title":"3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata","display_name":"3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1490895920","doi":"https://doi.org/10.25596/jalc-2002-419","mag":"1490895920"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.11.7044","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.7044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sunsite.informatik.rwth-aachen.de/Publications/AIB/2002/2002-06.ps.gz","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-419","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037086358","display_name":"Henry N. Adorna","orcid":"https://orcid.org/0000-0001-5513-4039"},"institutions":[{"id":"https://openalex.org/I87074743","display_name":"University of the Philippines Diliman","ror":"https://ror.org/03tbh6y23","country_code":"PH","type":"education","lineage":["https://openalex.org/I103911934","https://openalex.org/I87074743"]}],"countries":["PH"],"is_corresponding":true,"raw_author_name":"Adorna, Henry N.","raw_affiliation_strings":["Department of Mathematics, University of the Philippines, Diliman 1101 Q.C., Philippines#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of the Philippines, Diliman 1101 Q.C., Philippines#TAB#","institution_ids":["https://openalex.org/I87074743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037086358"],"corresponding_institution_ids":["https://openalex.org/I87074743"],"apc_list":null,"apc_paid":null,"fwci":0.7944,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.70273556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"4","first_page":"23","last_page":"34"},"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.9984999895095825,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9980999827384949,"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/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.8819692730903625},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8092036843299866},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7520297765731812},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.7054621577262878},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5666165351867676},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.5609956979751587},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5543220043182373},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5461245775222778},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4545326828956604},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.44528383016586304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42877477407455444},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.42715588212013245},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.4116635024547577},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3939327001571655},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3806687891483307},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35229188203811646}],"concepts":[{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.8819692730903625},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8092036843299866},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7520297765731812},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.7054621577262878},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5666165351867676},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.5609956979751587},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5543220043182373},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5461245775222778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4545326828956604},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.44528383016586304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42877477407455444},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.42715588212013245},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4116635024547577},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3939327001571655},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3806687891483307},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35229188203811646},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.11.7044","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.7044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sunsite.informatik.rwth-aachen.de/Publications/AIB/2002/2002-06.ps.gz","raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:108052","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/108052","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings / Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures : Vienna, Austria, July 20 - 22, 2001 / J\u00fcrgen Dassow ... (eds.)<br/>3. International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Vienna, Austria, 2001-07-20 - 2001-07-22","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.25596/jalc-2002-419","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-419","pdf_url":null,"source":{"id":"https://openalex.org/S7407052994","display_name":"Universit\u00e4tsbibliothek Gie\u00dfen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200763008","host_organization_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","host_organization_lineage":["https://openalex.org/I200763008"],"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:1490895920","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jalc/jalc7.html#Adorna02","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:2395599602","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/dcfs/dcfs2001.html#Adorna01","pdf_url":null,"source":{"id":"https://openalex.org/S4306507593","display_name":"DCFS","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"DCFS","raw_type":null}],"best_oa_location":{"id":"doi:10.25596/jalc-2002-419","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-419","pdf_url":null,"source":{"id":"https://openalex.org/S7407052994","display_name":"Universit\u00e4tsbibliothek Gie\u00dfen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200763008","host_organization_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","host_organization_lineage":["https://openalex.org/I200763008"],"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.5600000023841858,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W122920432","https://openalex.org/W1530407317","https://openalex.org/W1531381863","https://openalex.org/W1580860198","https://openalex.org/W1585714998","https://openalex.org/W1969367179","https://openalex.org/W1975732129","https://openalex.org/W1979801752","https://openalex.org/W2002501531","https://openalex.org/W2005214236","https://openalex.org/W2011039300","https://openalex.org/W2014618792","https://openalex.org/W2027620237","https://openalex.org/W2040834199","https://openalex.org/W2054230520","https://openalex.org/W2060972166","https://openalex.org/W2061668791","https://openalex.org/W2067002313","https://openalex.org/W2072453354","https://openalex.org/W2080108335","https://openalex.org/W2122493035","https://openalex.org/W2142151475","https://openalex.org/W2175167577","https://openalex.org/W2296545821","https://openalex.org/W2340787257","https://openalex.org/W2477544870"],"related_works":["https://openalex.org/W2395599602","https://openalex.org/W1198001383","https://openalex.org/W72530425","https://openalex.org/W2030569822","https://openalex.org/W2173305072","https://openalex.org/W2999050770","https://openalex.org/W2964037983","https://openalex.org/W1575419596","https://openalex.org/W3134046426","https://openalex.org/W2565271321","https://openalex.org/W2943213324","https://openalex.org/W56377157","https://openalex.org/W243230860","https://openalex.org/W3114817139","https://openalex.org/W2142151475","https://openalex.org/W2157017998","https://openalex.org/W1485984004","https://openalex.org/W2949287936","https://openalex.org/W2004898185","https://openalex.org/W2402722575"],"abstract_inverted_index":{"Despite":[0],"the":[1,9,24,49,52,86,89,117,120,147,153,169],"facts":[2],"that":[3,66,85],"automata":[4,124],"theory":[5],"is":[6,23,41,125,166],"one":[7],"of":[8,16,27,39,51,73,88,119,155,163],"oldest":[10],"and":[11,20,94,129,152],"most":[12],"extensively":[13],"investigated":[14],"areas":[15],"theoretical":[17],"computer":[18],"science,":[19],"finite":[21,36,55,92,98,123,159],"automaton":[22,56,93,99],"simplest":[25],"model":[26],"computation,":[28],"there":[29,138],"are":[30],"still":[31],"principal":[32],"open":[33],"problems":[34],"about":[35],"automata.":[37],"One":[38],"them":[40],"to":[42,167,177],"estimate,":[43],"for":[44,112,183],"a":[45,77,95,156],"regular":[46,140,185],"language":[47],"$L$,":[48],"size":[50,118,154],"minimal":[53,90,96,121,157],"nondeterministic":[54,97,122,158],"accepting":[57],"$L$.":[58],"Currently,":[59],"we":[60],"do":[61],"not":[62],"have":[63],"any":[64],"method":[65],"would":[67],"at":[68],"least":[69],"assure":[70],"an":[71,143],"approximation":[72],"this":[74,130,164],"value,":[75],"however,":[76],"lower":[78,114,150,172,181],"bound":[79,115,151,173],"could":[80],"be":[81,102],"obtained":[82],"by":[83],"noticing":[84],"sizes":[87],"deterministic":[91],"can":[100],"only":[101],"exponentially":[103],"apart":[104],"from":[105],"each":[106],"other.":[107],"The":[108,161],"best":[109],"known":[110],"technique":[111,131,174],"proving":[113],"on":[116,127],"based":[126],"communication":[128,148,170],"covers":[132],"all":[133],"previously":[134],"used":[135],"approaches.":[136],"Unfortunately,":[137],"exist":[139],"languages":[141],"with":[142],"exponential":[144],"gap":[145],"between":[146],"complexity":[149,171],"automaton.":[160],"contribution":[162],"paper":[165],"improve":[168],"in":[175],"order":[176],"get":[178],"essentially":[179],"better":[180],"bounds":[182],"some":[184],"languages.":[186]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}