{"id":"https://openalex.org/W1645602948","doi":"https://doi.org/10.1142/s0129054114400097","title":"SYNTACTIC COMPLEXITY OF \u211b- AND \ud835\udca5-TRIVIAL REGULAR LANGUAGES","display_name":"SYNTACTIC COMPLEXITY OF \u211b- AND \ud835\udca5-TRIVIAL REGULAR LANGUAGES","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W1645602948","doi":"https://doi.org/10.1142/s0129054114400097","mag":"1645602948"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054114400097","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400097","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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":null,"display_name":"JANUSZ BRZOZOWSKI","orcid":null},"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":true,"raw_author_name":"JANUSZ BRZOZOWSKI","raw_affiliation_strings":["David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3G1, Canada"],"affiliations":[{"raw_affiliation_string":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":null,"display_name":"BAIYU LI","orcid":null},"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":"BAIYU LI","raw_affiliation_strings":["David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3G1, Canada"],"affiliations":[{"raw_affiliation_string":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.7358,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70236783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"25","issue":"07","first_page":"807","last_page":"821"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.970300018787384,"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.970300018787384,"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.007899999618530273,"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.007600000128149986,"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/regular-language","display_name":"Regular language","score":0.6244999766349792},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5903000235557556},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4966000020503998},{"id":"https://openalex.org/keywords/abstract-family-of-languages","display_name":"Abstract family of languages","score":0.48010000586509705},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.4607999920845032},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4316999912261963},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.42250001430511475},{"id":"https://openalex.org/keywords/formal-language","display_name":"Formal language","score":0.38530001044273376}],"concepts":[{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.6244999766349792},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5903000235557556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5311999917030334},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4966000020503998},{"id":"https://openalex.org/C199163288","wikidata":"https://www.wikidata.org/wiki/Q3065587","display_name":"Abstract family of languages","level":5,"score":0.48010000586509705},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.4607999920845032},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45089998841285706},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42800000309944153},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.42250001430511475},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37929999828338623},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.3725999891757965},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.34950000047683716},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C157968401","wikidata":"https://www.wikidata.org/wiki/Q2292874","display_name":"Pumping lemma for regular languages","level":5,"score":0.30320000648498535},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27619999647140503},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C2986991398","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntactic structure","level":3,"score":0.2694999873638153},{"id":"https://openalex.org/C119903167","wikidata":"https://www.wikidata.org/wiki/Q3321297","display_name":"Syntactic monoid","level":4,"score":0.2524999976158142},{"id":"https://openalex.org/C80191660","wikidata":"https://www.wikidata.org/wiki/Q645527","display_name":"Regular grammar","level":4,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054114400097","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400097","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/12509","is_oa":false,"landing_page_url":"http://hdl.handle.net/10012/12509","pdf_url":null,"source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1978707564","https://openalex.org/W1985708211","https://openalex.org/W2022378152","https://openalex.org/W2094423121","https://openalex.org/W2116250539"],"related_works":[],"abstract_inverted_index":{"The":[0],"syntactic":[1,17,50],"complexity":[2,31,51],"of":[3,6,9,16,19,28,33,52],"a":[4,26],"subclass":[5],"the":[7,13,29,49],"class":[8],"regular":[10,56],"languages":[11,20],"is":[12],"maximal":[14],"cardinality":[15],"semigroups":[18],"in":[21],"that":[22,38],"class,":[23],"taken":[24],"as":[25],"function":[27],"state":[30],"n":[32],"these":[34],"languages.":[35],"We":[36],"prove":[37],"n!":[39],"and":[40,54],"\u230ae(n":[41],"\u2212":[42],"1)\u230b.":[43],"are":[44],"tight":[45],"upper":[46],"bounds":[47],"for":[48],"\u211b-":[53],"\ud835\udca5-trivial":[55],"languages,":[57],"respectively.":[58]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2016-06-24T00:00:00"}