{"id":"https://openalex.org/W1987076568","doi":"https://doi.org/10.1016/0022-0000(82)90044-7","title":"The equivalence problem for LL- and LR-regular grammars","display_name":"The equivalence problem for LL- and LR-regular grammars","publication_year":1982,"publication_date":"1982-04-01","ids":{"openalex":"https://openalex.org/W1987076568","doi":"https://doi.org/10.1016/0022-0000(82)90044-7","mag":"1987076568"},"language":"en","primary_location":{"id":"doi:10.1016/0022-0000(82)90044-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0022-0000(82)90044-7","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/the-equivalence-problem-for-ll-and-lrregular-grammars(8b69ffc3-cabf-42ff-8c10-b428b026a68e).html","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091392919","display_name":"Anton Nijholt","orcid":"https://orcid.org/0000-0002-5669-9290"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Anton Nijholt","raw_affiliation_strings":["Informatics Department, Nijmegen University, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Informatics Department, Nijmegen University, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091392919"],"corresponding_institution_ids":["https://openalex.org/I145872427"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.11582039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"2","first_page":"149","last_page":"161"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.989799976348877,"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/T10142","display_name":"Formal Methods in Verification","score":0.9879000186920166,"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.8220089673995972},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7706559896469116},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7516404986381531},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7303861975669861},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.7151919007301331},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.7124764323234558},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.7102997303009033},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.6360105276107788},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.6112473607063293},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.5881498456001282},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.5663356781005859},{"id":"https://openalex.org/keywords/phrase-structure-grammar","display_name":"Phrase structure grammar","score":0.5520768165588379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.503532350063324},{"id":"https://openalex.org/keywords/definite-clause-grammar","display_name":"Definite clause grammar","score":0.4399961829185486},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.42246949672698975},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40066832304000854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39150410890579224},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3522222638130188},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17850720882415771},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11681348085403442},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.09978938102722168},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.06133642792701721}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8220089673995972},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7706559896469116},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7516404986381531},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7303861975669861},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.7151919007301331},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.7124764323234558},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.7102997303009033},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.6360105276107788},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.6112473607063293},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.5881498456001282},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.5663356781005859},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.5520768165588379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.503532350063324},{"id":"https://openalex.org/C97169998","wikidata":"https://www.wikidata.org/wiki/Q1582738","display_name":"Definite clause grammar","level":5,"score":0.4399961829185486},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.42246949672698975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40066832304000854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39150410890579224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3522222638130188},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17850720882415771},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11681348085403442},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.09978938102722168},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.06133642792701721},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0022-0000(82)90044-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0022-0000(82)90044-7","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.216.5474","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.5474","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/9235/01/fct1981.pdf","raw_type":"text"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/8b69ffc3-cabf-42ff-8c10-b428b026a68e","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/the-equivalence-problem-for-ll-and-lrregular-grammars(8b69ffc3-cabf-42ff-8c10-b428b026a68e).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":"Journal of computer and system sciences, 24(2), 149 - 161. Academic Press Inc.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:ut:oai:ris.utwente.nl:publications/8b69ffc3-cabf-42ff-8c10-b428b026a68e","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/the-equivalence-problem-for-ll-and-lrregular-grammars(8b69ffc3-cabf-42ff-8c10-b428b026a68e).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":"Journal of computer and system sciences, 24(2), 149 - 161. Academic Press Inc.","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.6800000071525574,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W996650633","https://openalex.org/W1535681052","https://openalex.org/W1554219406","https://openalex.org/W1560546844","https://openalex.org/W1591068183","https://openalex.org/W1817451992","https://openalex.org/W1968127341","https://openalex.org/W1972613240","https://openalex.org/W1985025308","https://openalex.org/W1986683780","https://openalex.org/W2002023748","https://openalex.org/W2011725207","https://openalex.org/W2021146387","https://openalex.org/W2023090947","https://openalex.org/W2028072917","https://openalex.org/W2028512561","https://openalex.org/W2070015363","https://openalex.org/W2072170850","https://openalex.org/W2188913344","https://openalex.org/W2545845195","https://openalex.org/W2592184324","https://openalex.org/W4285719527","https://openalex.org/W6633181053","https://openalex.org/W6633404363","https://openalex.org/W6635242363","https://openalex.org/W6650684231","https://openalex.org/W6729250319"],"related_works":["https://openalex.org/W2403874525","https://openalex.org/W2130892661","https://openalex.org/W2460573387","https://openalex.org/W1970209336","https://openalex.org/W2914399682","https://openalex.org/W1609763579","https://openalex.org/W2055334547","https://openalex.org/W2153803459","https://openalex.org/W1558243495","https://openalex.org/W2067980891"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}