{"id":"https://openalex.org/W2166454947","doi":"https://doi.org/10.1080/00207169108804003","title":"On the generating power of regularly controlled bidirectional grammars","display_name":"On the generating power of regularly controlled bidirectional grammars","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W2166454947","doi":"https://doi.org/10.1080/00207169108804003","mag":"2166454947"},"language":"en","primary_location":{"id":"doi:10.1080/00207169108804003","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108804003","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":true,"oa_status":"green","oa_url":"https://ris.utwente.nl/ws/files/5105274/Asfeld88on.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055202784","display_name":"P.R.J. Asveld","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Peter R.J. Asveld","raw_affiliation_strings":["Department of Computer Science , University of Twente , P.O. Box 217, Enschede, AE, 7500, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Twente , P.O. Box 217, Enschede, AE, 7500, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010534774","display_name":"Jan Anne Hogendorp","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jan Anne HoGendorp","raw_affiliation_strings":["Department of Computer Science , University of Twente , P.O. Box 217, Enschede, AE, 7500, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Twente , P.O. Box 217, Enschede, AE, 7500, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055202784"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.26392405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"1-2","first_page":"75","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9958000183105469,"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.993399977684021,"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/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.8440700173377991},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.7723566293716431},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.7429172396659851},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.6540253162384033},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6093997955322266},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.594784140586853},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.5835978388786316},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5806365013122559},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5533977746963501},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.5090303421020508},{"id":"https://openalex.org/keywords/mode","display_name":"Mode (computer interface)","score":0.43045851588249207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3503343462944031},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2958192229270935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2883718013763428},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.18152886629104614}],"concepts":[{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.8440700173377991},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.7723566293716431},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.7429172396659851},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.6540253162384033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6093997955322266},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.594784140586853},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.5835978388786316},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5806365013122559},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5533977746963501},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5090303421020508},{"id":"https://openalex.org/C48677424","wikidata":"https://www.wikidata.org/wiki/Q6888088","display_name":"Mode (computer interface)","level":2,"score":0.43045851588249207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3503343462944031},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2958192229270935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2883718013763428},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.18152886629104614},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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":7,"locations":[{"id":"doi:10.1080/00207169108804003","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108804003","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"},{"id":"pmh:oai:ris.utwente.nl:openaire/406946b8-4d31-40e2-a1a1-43ad4d1d9366","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/406946b8-4d31-40e2-a1a1-43ad4d1d9366","pdf_url":"https://ris.utwente.nl/ws/files/5105274/Asfeld88on.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Asveld, P R J & Hogendorp, J A 1989, On the Generating Power of Regularly Controlled Bidirectional Grammars. Memoranda Informatica, no. INF 89-68, University of Twente, Enschede.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:ris.utwente.nl:publications/6dd526f8-afb5-4c69-aa2b-7d2843829dc4","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/6dd526f8-afb5-4c69-aa2b-7d2843829dc4","pdf_url":"https://ris.utwente.nl/ws/files/6405619/Asveld91on.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Asveld, P R J & Hogendorp, J A 1991, 'On the Generating Power of Regularly Controlled Bidirectional Grammars', International journal of computer mathematics, vol. 40, no. 1, pp. 75-91. https://doi.org/10.1080/00207169108804003","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.216.3837","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.3837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprints.eemcs.utwente.nl/9414/01/MI_89_68.pdf","raw_type":"text"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/1cc673c0-d340-4835-9955-6ca93ac5fbe0","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/on-the-generating-power-of-regularly-controlled-bidirectional-grammars(1cc673c0-d340-4835-9955-6ca93ac5fbe0).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Memoranda informatica, 0(68). University of Twente","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/406946b8-4d31-40e2-a1a1-43ad4d1d9366","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/on-the-generating-power-of-regularly-controlled-bidirectional-grammars(406946b8-4d31-40e2-a1a1-43ad4d1d9366).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"info:eu-repo/semantics/report"},{"id":"mag:2166454947","is_oa":false,"landing_page_url":"https://core.ac.uk/download/pdf/11454190.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306519701","display_name":"Memoranda informatica","issn_l":null,"issn":null,"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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Memoranda informatica","raw_type":null}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/406946b8-4d31-40e2-a1a1-43ad4d1d9366","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/406946b8-4d31-40e2-a1a1-43ad4d1d9366","pdf_url":"https://ris.utwente.nl/ws/files/5105274/Asfeld88on.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Asveld, P R J & Hogendorp, J A 1989, On the Generating Power of Regularly Controlled Bidirectional Grammars. Memoranda Informatica, no. INF 89-68, University of Twente, Enschede.","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2166454947.pdf","grobid_xml":"https://content.openalex.org/works/W2166454947.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1535681052","https://openalex.org/W1711810749","https://openalex.org/W1990211242","https://openalex.org/W1997305350","https://openalex.org/W2002089154","https://openalex.org/W2013209763","https://openalex.org/W2020651750","https://openalex.org/W2023198763","https://openalex.org/W2032623970","https://openalex.org/W2033706603","https://openalex.org/W2050232471","https://openalex.org/W2075454140","https://openalex.org/W2076858908","https://openalex.org/W2147317083","https://openalex.org/W3023156432","https://openalex.org/W3023251014"],"related_works":["https://openalex.org/W1547721453","https://openalex.org/W2460573387","https://openalex.org/W2803777011","https://openalex.org/W3190898312","https://openalex.org/W207821149","https://openalex.org/W1896649124","https://openalex.org/W1525975146","https://openalex.org/W3044192055","https://openalex.org/W2222745226","https://openalex.org/W2147186707","https://openalex.org/W2228837859","https://openalex.org/W1062543421","https://openalex.org/W2948211918","https://openalex.org/W2914480740","https://openalex.org/W3102837764","https://openalex.org/W2087329142","https://openalex.org/W1512386289","https://openalex.org/W790732999","https://openalex.org/W1979054319","https://openalex.org/W1507356070"],"abstract_inverted_index":{"RCB":[0,102,139],"grammars":[1,6,9,103],"or":[2],"regularly":[3],"controlled":[4,33],"bidirectional":[5],"are":[7],"context-free":[8],"of":[10,29,40,48,56,80,84,113,120,124,136],"which":[11,75],"the":[12,27,53,57,81,88,95,100,106,111,121],"rules":[13,31],"can":[14,42],"be":[15,43],"used":[16],"in":[17,21,131,134],"a":[18,22,35,68,77,118],"productive":[19],"and":[20,92],"reductive":[23],"fashion.":[24],"In":[25,50],"addition,":[26],"application":[28],"these":[30],"is":[32,65,73,76],"by":[34,127],"regular":[36],"language.":[37],"Several":[38],"modes":[39],"derivation":[41,58],"distinguished":[44],"for":[45],"this":[46,51],"kind":[47],"grammar.":[49],"paper":[52],"generating":[54,97],"power":[55],"mode":[59,70],"that":[60],"uses":[61],"right-occurrence":[62,85],"rewriting":[63,86],"(RO-mode)":[64],"determined.":[66],"Furthermore,":[67],"new":[69],"called":[71],"RA":[72],"introduced,":[74],"better":[78],"formalization":[79],"intuitive":[82],"idea":[83],"than":[87],"RO-mode.":[89],"The":[90],"RO":[91],"RA-mode":[93],"have":[94],"same":[96],"power,":[98],"viz.":[99],"corresponding":[101],"both":[104],"generate":[105],"recursively":[107],"enumerable":[108],"languages.":[109],"Modifying":[110],"proof":[112],"our":[114],"main":[115],"result":[116],"yields":[117],"characterization":[119],"family":[122],"NP":[123],"languages":[125],"acceptable":[126],"nondeterministic":[128],"Turing":[129],"machines":[130],"polynomial":[132],"time":[133],"terms":[135],"polynomially":[137],"time-bounded":[138],"grammars.":[140]},"counts_by_year":[],"updated_date":"2026-05-18T08:16:58.900851","created_date":"2025-10-10T00:00:00"}