{"id":"https://openalex.org/W1978057069","doi":"https://doi.org/10.1080/00207169508804411","title":"On properties of edtol and rwdol languages and the constructibility of finite morphic refinements","display_name":"On properties of edtol and rwdol languages and the constructibility of finite morphic refinements","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1978057069","doi":"https://doi.org/10.1080/00207169508804411","mag":"1978057069"},"language":"en","primary_location":{"id":"doi:10.1080/00207169508804411","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804411","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5010440892","display_name":"John Harrison","orcid":"https://orcid.org/0000-0001-5707-4631"},"institutions":[{"id":"https://openalex.org/I160003610","display_name":"Wilkes University","ror":"https://ror.org/054nntz49","country_code":"US","type":"education","lineage":["https://openalex.org/I160003610"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Harrison","raw_affiliation_strings":["Department of Math and Computer Science , Wilkes University , Wilkes-Barre, PA, 18702"],"affiliations":[{"raw_affiliation_string":"Department of Math and Computer Science , Wilkes University , Wilkes-Barre, PA, 18702","institution_ids":["https://openalex.org/I160003610"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010440892"],"corresponding_institution_ids":["https://openalex.org/I160003610"],"apc_list":null,"apc_paid":null,"fwci":0.521,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61020695,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"57","issue":"1-2","first_page":"57","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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.9990000128746033,"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.9965999722480774,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9950000047683716,"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/decidability","display_name":"Decidability","score":0.7470366358757019},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7350702285766602},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.599390983581543},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5159714818000793},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41840633749961853},{"id":"https://openalex.org/keywords/abstract-family-of-languages","display_name":"Abstract family of languages","score":0.41745448112487793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20806655287742615},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.18691125512123108},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15293821692466736},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11682870984077454}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7470366358757019},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7350702285766602},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.599390983581543},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5159714818000793},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41840633749961853},{"id":"https://openalex.org/C199163288","wikidata":"https://www.wikidata.org/wiki/Q3065587","display_name":"Abstract family of languages","level":5,"score":0.41745448112487793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20806655287742615},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.18691125512123108},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15293821692466736},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11682870984077454},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.0},{"id":"https://openalex.org/C11164408","wikidata":"https://www.wikidata.org/wiki/Q18657800","display_name":"Second-generation programming language","level":4,"score":0.0},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169508804411","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804411","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2000670348","https://openalex.org/W2002089154","https://openalex.org/W2018291282","https://openalex.org/W2059389477","https://openalex.org/W2081974394","https://openalex.org/W2095100236","https://openalex.org/W2586374872","https://openalex.org/W2805677007","https://openalex.org/W4285719527","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1865715204","https://openalex.org/W1994637428","https://openalex.org/W2096284940","https://openalex.org/W2916830211","https://openalex.org/W2964662755","https://openalex.org/W2021535402","https://openalex.org/W4232397231","https://openalex.org/W1569124960","https://openalex.org/W2950141706","https://openalex.org/W2017318974"],"abstract_inverted_index":{"In":[0,45,109],"[5],":[1],"it":[2],"was":[3],"shown":[4,52,205],"that":[5,53,131],"every":[6],"regular":[7,64,98,122,141,148,161],"language":[8,134,142,201],"R":[9],"and":[10,157,200],"its":[11],"complement":[12],"is":[13,143,145,173],"refined":[14],"by":[15,22,96,103,179],"a":[16,23,40,119,121,146,160,212],"finite":[17],"partition":[18],"of":[19,43,48,61,83,93,107,112,126,135,155,169,176,193],"A":[20],"induced":[21],"morphic":[24,187],"(or":[25],"equivalently":[26],"fully":[27],"invariant)":[28],"congruence":[29],"relation.":[30],"More":[31],"importantly,":[32],"this":[33,49,84,113,194],"refinement":[34],"can":[35],"be":[36,207],"effectively":[37],"constructed":[38],"given":[39,115,140,213],"finite-state":[41],"representation":[42],"R.":[44],"section":[46,79,110,191],"two":[47,104],"paper,":[50,114],"it's":[51],"with":[54,100,138],"respect":[55],"to":[56,206],"the":[57,63,70,75,81,124,132,139,153,167,177,196],"standard":[58],"Chomsky":[59],"Hierarchy":[60],"Languages,":[62],"languages":[65,94,99,101],"are":[66,204],"unique":[67],"in":[68,78,128,151,159,181,190,208],"having":[69],"aforementioned":[71],"property.":[72],"Based":[73],"on":[74,87],"result":[76,178],"obtained":[77],"two,":[80],"remainder":[82],"work":[85],"focuses":[86],"obtaining":[88],"decidability":[89],"results":[90],"for":[91,166,183,211],"classes":[92],"generated":[95,102],"intersecting":[97],"specific":[105],"types":[106],"L-systems.":[108],"three":[111],"an":[116,174],"EDTOL":[117,133,170],"scheme":[118],"nd":[120],"language,":[123],"set":[125,162],"strings":[127],"A*":[129],"such":[130],"w":[136],"intersected":[137],"empty":[144],"constructible":[147],"language.":[149],"Thus":[150],"particular,":[152],"problems":[154,203],"emptiness":[156],"containment":[158],"are,in":[163],"general,":[164,209],"decidable":[165,210],"class":[168],"languages.":[171],"This":[172],"extension":[175],"Harrison":[180],"[5]":[182],"DOL":[184],"systems":[185],"using":[186],"refinements.":[188],"Finally,":[189],"four":[192],"work,":[195],"membership,":[197],"sequence":[198],"equivalence":[199,202],"RWDOL":[214],"system.":[215]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}