{"id":"https://openalex.org/W2350714487","doi":"https://doi.org/10.3390/a9020032","title":"Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey","display_name":"Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey","publication_year":2016,"publication_date":"2016-05-11","ids":{"openalex":"https://openalex.org/W2350714487","doi":"https://doi.org/10.3390/a9020032","mag":"2350714487"},"language":"en","primary_location":{"id":"doi:10.3390/a9020032","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a9020032","pdf_url":"https://www.mdpi.com/1999-4893/9/2/32/pdf?version=1462973523","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/9/2/32/pdf?version=1462973523","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101796946","display_name":"Henrik Bj\u00f6rklund","orcid":"https://orcid.org/0000-0002-4696-9787"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Henrik Bj\u00f6rklund","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028862129","display_name":"Martin Berglund","orcid":"https://orcid.org/0000-0002-3692-6994"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Martin Berglund","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006944889","display_name":"Petter Ericson","orcid":"https://orcid.org/0000-0002-8722-5661"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Petter Ericson","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 University, SE-901 87 Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101796946"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.6969,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73735756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"9","issue":"2","first_page":"32","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9986000061035156,"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.9986000061035156,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.996399998664856,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9930999875068665,"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/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.932151198387146},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.8098009824752808},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7955976128578186},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.7485095262527466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7461358904838562},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6302585601806641},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.608082115650177},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5520489811897278},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5256472826004028},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4611065983772278},{"id":"https://openalex.org/keywords/parse-tree","display_name":"Parse tree","score":0.43963998556137085},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41199684143066406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3707770109176636},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.289018452167511},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.28392505645751953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21702265739440918},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09030511975288391}],"concepts":[{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.932151198387146},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.8098009824752808},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7955976128578186},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.7485095262527466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7461358904838562},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6302585601806641},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.608082115650177},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5520489811897278},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5256472826004028},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4611065983772278},{"id":"https://openalex.org/C2781466058","wikidata":"https://www.wikidata.org/wiki/Q627921","display_name":"Parse tree","level":3,"score":0.43963998556137085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41199684143066406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3707770109176636},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.289018452167511},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.28392505645751953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21702265739440918},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09030511975288391},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a9020032","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a9020032","pdf_url":"https://www.mdpi.com/1999-4893/9/2/32/pdf?version=1462973523","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:umu-120238","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-120238","pdf_url":null,"source":{"id":"https://openalex.org/S4306400361","display_name":"DiVA at Ume\u00e5 University (Ume\u00e5 University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I90267481","host_organization_name":"Ume\u00e5 University","host_organization_lineage":["https://openalex.org/I90267481"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article in journal"},{"id":"pmh:oai:doaj.org/article:9803c0d69a22410b866f33ba9b95402c","is_oa":true,"landing_page_url":"https://doaj.org/article/9803c0d69a22410b866f33ba9b95402c","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 9, Iss 2, p 32 (2016)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/9/2/32/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a9020032","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 9; Issue 2; Pages: 32","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a9020032","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a9020032","pdf_url":"https://www.mdpi.com/1999-4893/9/2/32/pdf?version=1462973523","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.7799999713897705,"display_name":"Quality Education"}],"awards":[{"id":"https://openalex.org/G1726120163","display_name":null,"funder_award_id":"621-2011-6080","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2350714487.pdf","grobid_xml":"https://content.openalex.org/works/W2350714487.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W128861109","https://openalex.org/W154248286","https://openalex.org/W162009636","https://openalex.org/W253016946","https://openalex.org/W421997344","https://openalex.org/W1498505829","https://openalex.org/W1508382620","https://openalex.org/W1587619488","https://openalex.org/W1649160680","https://openalex.org/W1687940340","https://openalex.org/W1970047378","https://openalex.org/W1987709131","https://openalex.org/W2002089154","https://openalex.org/W2013728008","https://openalex.org/W2018964411","https://openalex.org/W2038141781","https://openalex.org/W2058471653","https://openalex.org/W2060300993","https://openalex.org/W2087945397","https://openalex.org/W2089385274","https://openalex.org/W2101481752","https://openalex.org/W2121924470","https://openalex.org/W2122076344","https://openalex.org/W2124479173","https://openalex.org/W2130035786","https://openalex.org/W4234352621","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W1991936877","https://openalex.org/W4244615522","https://openalex.org/W1972256049","https://openalex.org/W2338828339","https://openalex.org/W2166677757","https://openalex.org/W2141288413","https://openalex.org/W3123688778","https://openalex.org/W1634973882","https://openalex.org/W2049995120","https://openalex.org/W2033808215"],"abstract_inverted_index":{"Parsing":[0],"for":[1,21,35,51,109],"mildly":[2],"context-sensitive":[3],"language":[4,12],"formalisms":[5,24,85],"is":[6,25,31,106],"an":[7],"important":[8],"area":[9],"within":[10],"natural":[11],"processing.":[13],"While":[14],"the":[15,18,33,47,62,84,89],"complexity":[16,48,68,73],"of":[17,37,44,49,83,113],"parsing":[19,50,90,105],"problem":[20,91],"some":[22],"such":[23,115],"known":[26],"to":[27,78],"be":[28,76],"polynomial,":[29],"this":[30],"not":[32],"case":[34],"all":[36,99],"them.":[38],"This":[39],"article":[40],"presents":[41],"a":[42,121],"series":[43],"results":[45,95,101],"regarding":[46],"linear":[52],"context-free":[53],"rewriting":[54,122],"systems":[55],"and":[56,66,70,102,118],"deterministic":[57],"tree-walking":[58],"transducers.":[59],"We":[60],"discuss":[61],"difference":[63],"between":[64],"uniform":[65],"nonuniform":[67],"measures":[69],"how":[71,80,87],"parameterized":[72],"theory":[74],"can":[75],"used":[77],"investigate":[79],"different":[81],"aspects":[82],"influence":[86],"hard":[88,107],"is.":[92],"The":[93],"main":[94],"we":[96],"survey":[97],"are":[98],"hardness":[100],"indicate":[103],"that":[104],"even":[108],"relatively":[110],"small":[111],"values":[112],"parameters":[114],"as":[116],"rank":[117],"fan-out":[119],"in":[120],"system.":[123]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}