{"id":"https://openalex.org/W130252587","doi":"https://doi.org/10.25596/jalc-2012-145","title":"On Subregular Selection Languages in Internal Contextual Grammars","display_name":"On Subregular Selection Languages in Internal Contextual Grammars","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W130252587","doi":"https://doi.org/10.25596/jalc-2012-145","mag":"130252587"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2012-145","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2012-145","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2012-145","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073072370","display_name":"J\u00fcrgen Dassow","orcid":"https://orcid.org/0000-0002-4735-4696"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dassow, J\u00fcrgen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006548981","display_name":"Flor\u00edn Manea","orcid":"https://orcid.org/0000-0001-6094-3324"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manea, Florin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010363248","display_name":"Bianca Truthe","orcid":"https://orcid.org/0000-0003-0031-5275"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Truthe, Bianca","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3473,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.58246037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"17","issue":null,"first_page":"145","last_page":"147"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9977999925613403,"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.9977999925613403,"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.9800000190734863,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9110999703407288,"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/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6691218614578247},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5967459678649902},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5756869912147522},{"id":"https://openalex.org/keywords/language-family","display_name":"Language family","score":0.5675082802772522},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47698718309402466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46977800130844116},{"id":"https://openalex.org/keywords/nilpotent","display_name":"Nilpotent","score":0.46376845240592957},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.4564398229122162},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.45098739862442017},{"id":"https://openalex.org/keywords/abstract-family-of-languages","display_name":"Abstract family of languages","score":0.4415375590324402},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3058372437953949},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.3020496368408203},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2795218825340271},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.25423258543014526},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23777896165847778},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.20428809523582458},{"id":"https://openalex.org/keywords/second-generation-programming-language","display_name":"Second-generation programming language","score":0.16277098655700684},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.151309996843338},{"id":"https://openalex.org/keywords/fifth-generation-programming-language","display_name":"Fifth-generation programming language","score":0.08637845516204834}],"concepts":[{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6691218614578247},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5967459678649902},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5756869912147522},{"id":"https://openalex.org/C2780566098","wikidata":"https://www.wikidata.org/wiki/Q25295","display_name":"Language family","level":2,"score":0.5675082802772522},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47698718309402466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46977800130844116},{"id":"https://openalex.org/C50555996","wikidata":"https://www.wikidata.org/wiki/Q840023","display_name":"Nilpotent","level":2,"score":0.46376845240592957},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.4564398229122162},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.45098739862442017},{"id":"https://openalex.org/C199163288","wikidata":"https://www.wikidata.org/wiki/Q3065587","display_name":"Abstract family of languages","level":5,"score":0.4415375590324402},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3058372437953949},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.3020496368408203},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2795218825340271},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.25423258543014526},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23777896165847778},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.20428809523582458},{"id":"https://openalex.org/C11164408","wikidata":"https://www.wikidata.org/wiki/Q18657800","display_name":"Second-generation programming language","level":4,"score":0.16277098655700684},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.151309996843338},{"id":"https://openalex.org/C199305712","wikidata":"https://www.wikidata.org/wiki/Q3205914","display_name":"Fifth-generation programming language","level":3,"score":0.08637845516204834},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.25596/jalc-2012-145","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2012-145","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:130252587","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eik/eik17.html#BethS81a","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}],"best_oa_location":{"id":"doi:10.25596/jalc-2012-145","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2012-145","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"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":"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":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.6899999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1893933614","https://openalex.org/W1987704784","https://openalex.org/W2071176745","https://openalex.org/W1566468046","https://openalex.org/W2348265516","https://openalex.org/W2381458260","https://openalex.org/W1933394485","https://openalex.org/W2478192717","https://openalex.org/W1480661465","https://openalex.org/W878533978","https://openalex.org/W1492112506","https://openalex.org/W2144474429","https://openalex.org/W2165069172","https://openalex.org/W2165486719","https://openalex.org/W2351882339","https://openalex.org/W1815071379","https://openalex.org/W2352448339","https://openalex.org/W1954114910","https://openalex.org/W1780275742","https://openalex.org/W2164240893"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,23,48,71],"study":[4],"the":[5,17,54,76],"power":[6,77],"of":[7,16,19,53,57,78],"internal":[8,61,79],"contextual":[9,62,80],"grammars":[10,63,81],"with":[11,64,82],"selection":[12,65,97],"languages":[13,58,66],"from":[14],"subfamilies":[15],"family":[18],"regular":[20,46,89,91,93],"languages.":[21,98],"If":[22],"consider":[24],"families":[25,56],"${\\cal":[26,68],"F}_n$":[27],"which":[28],"are":[29],"obtained":[30],"by":[31,60],"restriction":[32],"to":[33,40,43],"$n$":[34],"states,":[35],"nonterminals,":[36],"productions,":[37],"or":[38,42],"symbols":[39],"accept":[41],"generate":[44],"a":[45],"language,":[47],"obtain":[49],"four":[50],"infinite":[51],"hierarchies":[52],"corresponding":[55],"generated":[59],"in":[67],"F}_n$.":[69],"Moreover,":[70],"present":[72],"some":[73],"results":[74],"on":[75],"finite,":[83],"monoidal,":[84],"nilpotent,":[85],"combinational,":[86],"definite,":[87],"ordered,":[88],"commutative,":[90],"circular,":[92],"suffix-closed,":[94],"and":[95],"union-free":[96]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}