{"id":"https://openalex.org/W1990301073","doi":"https://doi.org/10.1080/00207169008803892","title":"Time-bounded controlled bidirectional grammars","display_name":"Time-bounded controlled bidirectional grammars","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W1990301073","doi":"https://doi.org/10.1080/00207169008803892","mag":"1990301073"},"language":"en","primary_location":{"id":"doi:10.1080/00207169008803892","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169008803892","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/5103127/Hogendorp88time.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Jan Anne Hogendorp","raw_affiliation_strings":["Department of Computer Sciennce , University of Twente , P.O.Box 217, Enschede, 7500AE, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciennce , University of Twente , P.O.Box 217, Enschede, 7500AE, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010534774"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":null,"apc_paid":null,"fwci":0.1496,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.44985903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"1-4","first_page":"93","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9955999851226807,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9955999851226807,"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/T11567","display_name":"semigroups and automata theory","score":0.9926999807357788,"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.986299991607666,"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/context-free-grammar","display_name":"Context-free grammar","score":0.7257258892059326},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.7124172449111938},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.7111937403678894},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.7048137187957764},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.6407122611999512},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6301829814910889},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6129870414733887},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.5025854110717773},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.49930572509765625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49328702688217163},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4784405529499054},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4741120934486389},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.43499213457107544},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.4333465099334717},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3612516522407532},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30559635162353516},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.16500213742256165}],"concepts":[{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.7257258892059326},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.7124172449111938},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.7111937403678894},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.7048137187957764},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.6407122611999512},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6301829814910889},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6129870414733887},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.5025854110717773},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.49930572509765625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49328702688217163},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4784405529499054},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4741120934486389},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.43499213457107544},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4333465099334717},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3612516522407532},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30559635162353516},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.16500213742256165},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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/00207169008803892","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169008803892","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_cris_publications/7a2b92d8-655f-4c84-923b-2ea2fb3d45e7","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/7a2b92d8-655f-4c84-923b-2ea2fb3d45e7","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hogendorp, J A 1990, 'Time-bounded controlled bidirectional grammars', International journal of computer mathematics, vol. 35, no. 1-4, pp. 93-115. https://doi.org/10.1080/00207169008803892","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:openaire/d15b50eb-4bd3-4389-bd21-e8fd3d99fcc2","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/d15b50eb-4bd3-4389-bd21-e8fd3d99fcc2","pdf_url":"https://ris.utwente.nl/ws/files/5103127/Hogendorp88time.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":"Hogendorp, J A 1988, Time-Bounded Controlled Bidirectional Grammars. Memoranda Informatica, no. INF-88-53, University of Twente, Enschede.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.216.1430","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.1430","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/10887/01/1989cbg.pdf","raw_type":"text"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/7a2b92d8-655f-4c84-923b-2ea2fb3d45e7","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/timebounded-controlled-bidirectional-grammars(7a2b92d8-655f-4c84-923b-2ea2fb3d45e7).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":"International journal of computer mathematics, 35(1-4), 93 - 115. Taylor & Francis","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/d15b50eb-4bd3-4389-bd21-e8fd3d99fcc2","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/timebounded-controlled-bidirectional-grammars(d15b50eb-4bd3-4389-bd21-e8fd3d99fcc2).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:1990301073","is_oa":false,"landing_page_url":"https://ris.utwente.nl/ws/files/5103127/Hogendorp88time.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/d15b50eb-4bd3-4389-bd21-e8fd3d99fcc2","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/d15b50eb-4bd3-4389-bd21-e8fd3d99fcc2","pdf_url":"https://ris.utwente.nl/ws/files/5103127/Hogendorp88time.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":"Hogendorp, J A 1988, Time-Bounded Controlled Bidirectional Grammars. Memoranda Informatica, no. INF-88-53, University of Twente, Enschede.","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[{"score":0.5699999928474426,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1990301073.pdf","grobid_xml":"https://content.openalex.org/works/W1990301073.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W172045501","https://openalex.org/W1535681052","https://openalex.org/W1580591826","https://openalex.org/W1711810749","https://openalex.org/W2032623970","https://openalex.org/W2033706603","https://openalex.org/W2057834256","https://openalex.org/W2135953325","https://openalex.org/W2147317083","https://openalex.org/W2914032487"],"related_works":["https://openalex.org/W3023156432","https://openalex.org/W1547721453","https://openalex.org/W1532515103","https://openalex.org/W1992141493","https://openalex.org/W3044192055","https://openalex.org/W3190898312","https://openalex.org/W2123414912","https://openalex.org/W2165539736","https://openalex.org/W1525975146","https://openalex.org/W790732999","https://openalex.org/W2096819177","https://openalex.org/W3098700721","https://openalex.org/W2002874795","https://openalex.org/W2151989760","https://openalex.org/W2460573387","https://openalex.org/W3130625959","https://openalex.org/W2077039808","https://openalex.org/W1979054319","https://openalex.org/W2038010989","https://openalex.org/W1989196587"],"abstract_inverted_index":{"We":[0,102],"study":[1],"regularly":[2],"controlled":[3,39],"bidirectional":[4],"(RCB)":[5],"grammars":[6,16],"from":[7],"the":[8,19,33,110,116],"viewpoint":[9],"of":[10,17,35,46,54,66,73,80,100,112,118],"time-bounded":[11],"grammars.":[12],"RCB-grammars":[13],"are":[14,95],"context-free":[15],"which":[18],"rules":[20,37],"can":[21,48],"be":[22,49],"used":[23],"in":[24,28],"a":[25,29,41,61,64,87],"productive":[26],"and":[27,76,86,115],"reductive":[30],"fashion,":[31],"while":[32],"application":[34],"these":[36],"is":[38,63],"by":[40],"regular":[42],"language.":[43],"Several":[44],"modes":[45,79,99],"derivation":[47,81],"distinguished":[50],"for":[51,77,97],"this":[52],"kind":[53],"grammar.":[55],"A":[56],"time":[57,74],"bound":[58],"on":[59],"such":[60],"grammar":[62],"measure":[65],"its":[67],"derivational":[68],"complexity.":[69],"For":[70],"some":[71,78,98],"families":[72],"bounds":[75],"we":[82],"establish":[83],"closure":[84],"properties":[85],"normal":[88],"form":[89],"theorem.":[90],"In":[91],"addition":[92],"parsing":[93],"algorithms":[94],"given":[96],"derivation.":[101],"conclude":[103],"with":[104,107],"considering":[105],"generalizations":[106],"respect":[108],"to":[109],"family":[111,117],"control":[113],"languages":[114],"bounding":[119],"functions..":[120]},"counts_by_year":[],"updated_date":"2026-03-21T08:13:44.787528","created_date":"2025-10-10T00:00:00"}