{"id":"https://openalex.org/W2011252827","doi":"https://doi.org/10.1142/s0129054103002199","title":"NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES","display_name":"NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES","publication_year":2003,"publication_date":"2003-12-01","ids":{"openalex":"https://openalex.org/W2011252827","doi":"https://doi.org/10.1142/s0129054103002199","mag":"2011252827"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054103002199","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103002199","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":"https://openalex.org/A5016664760","display_name":"Markus Holzer","orcid":"https://orcid.org/0000-0003-4224-4014"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MARKUS HOLZER","raw_affiliation_strings":["Institut f\u00fcr Informatik,  Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3,  D-85748 Garching bei M\u00fcnchen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik,  Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3,  D-85748 Garching bei M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026803820","display_name":"Martin Kutrib","orcid":"https://orcid.org/0000-0002-9564-2625"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MARTIN KUTRIB","raw_affiliation_strings":["Institut f\u00fcr Informatik,  Universit\u00e4t Giessen, Arndtstra\u00dfe 2,  D-35392 Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik,  Universit\u00e4t Giessen, Arndtstra\u00dfe 2,  D-35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2401,"has_fulltext":false,"cited_by_count":148,"citation_normalized_percentile":{"value":0.92042383,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"14","issue":"06","first_page":"1087","last_page":"1102"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9961000084877014,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9937999844551086,"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/concatenation","display_name":"Concatenation (mathematics)","score":0.7012978792190552},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.6885042190551758},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6582636833190918},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6266705393791199},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5866202116012573},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5571472644805908},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5486999154090881},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.546278178691864},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.4547045826911926},{"id":"https://openalex.org/keywords/catenation","display_name":"Catenation","score":0.4126438796520233},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3680611848831177},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3642743229866028},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32886698842048645},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.28416380286216736},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.26181501150131226},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2319338023662567},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1989096999168396}],"concepts":[{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.7012978792190552},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.6885042190551758},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6582636833190918},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6266705393791199},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5866202116012573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5571472644805908},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5486999154090881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.546278178691864},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.4547045826911926},{"id":"https://openalex.org/C76787000","wikidata":"https://www.wikidata.org/wiki/Q334951","display_name":"Catenation","level":3,"score":0.4126438796520233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3680611848831177},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3642743229866028},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32886698842048645},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.28416380286216736},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.26181501150131226},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2319338023662567},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1989096999168396},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C552990157","wikidata":"https://www.wikidata.org/wiki/Q7430","display_name":"DNA","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054103002199","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103002199","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:geb.uni-giessen.de:1194","is_oa":false,"landing_page_url":"http://geb.uni-giessen.de/geb/volltexte/2003/1194/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401439","display_name":"University writing server of the Justus Liebig University Giessen (Justus-Liebig-Universit\u00e4t 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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:workingPaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W963086913","https://openalex.org/W1515528048","https://openalex.org/W1971747251","https://openalex.org/W1982206794","https://openalex.org/W1988560957","https://openalex.org/W1990283467","https://openalex.org/W1991409518","https://openalex.org/W2006629323","https://openalex.org/W2037872771","https://openalex.org/W2040834199","https://openalex.org/W2063230375","https://openalex.org/W2091815190","https://openalex.org/W2095282951","https://openalex.org/W4211010176"],"related_works":["https://openalex.org/W22759520","https://openalex.org/W2772918710","https://openalex.org/W1981823970","https://openalex.org/W1945859206","https://openalex.org/W2095282951","https://openalex.org/W2096694877","https://openalex.org/W2006629323","https://openalex.org/W2488819432","https://openalex.org/W2104263368","https://openalex.org/W2407531803"],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,42,46,52,58,65,72],"descriptional":[3],"complexity":[4],"of":[5,45,55,74],"operations":[6,34],"on":[7],"finite":[8,24],"and":[9,15,41,62],"infinite":[10],"regular":[11],"languages":[12,19],"over":[13],"unary":[14],"arbitrary":[16],"alphabets.":[17],"The":[18],"are":[20,49,76],"represented":[21],"by":[22],"nondeterministic":[23],"automata":[25],"(NFA).":[26],"In":[27],"particular,":[28],"we":[29],"consider":[30],"Boolean":[31],"operations,":[32],"catenation":[33],"\u2013":[35,40],"concatenation,":[36],"iteration,":[37],"\u03bb-free":[38],"iteration":[39],"reversal.":[43],"Most":[44],"shown":[47],"bounds":[48,70],"tight":[50,69],"in":[51,64,71],"exact":[53],"number":[54,59],"states,":[56],"i.e.":[57],"is":[60],"sufficient":[61],"necessary":[63],"worst":[66],"case.":[67],"Otherwise":[68],"order":[73],"magnitude":[75],"shown.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":16}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}