{"id":"https://openalex.org/W2131390643","doi":"https://doi.org/10.1016/s0304-3975(99)00106-1","title":"Complete formal systems for equivalence problems","display_name":"Complete formal systems for equivalence problems","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2131390643","doi":"https://doi.org/10.1016/s0304-3975(99)00106-1","mag":"2131390643"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(99)00106-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(99)00106-1","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","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/A5079033963","display_name":"G\u00e9raud S\u00e9nizergues","orcid":"https://orcid.org/0000-0002-5800-2506"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"G\u00e9raud S\u00e9nizergues","raw_affiliation_strings":["LaBRI and Bordeaux 1 University, CNRS, U.R.a. 1304, 351 Cours de la lib\u00e9ration, 33405, Talence Cedex, France","LaBRI and Bordeaux1 Unix., Talence, France#TAB#"],"affiliations":[{"raw_affiliation_string":"LaBRI and Bordeaux 1 University, CNRS, U.R.a. 1304, 351 Cours de la lib\u00e9ration, 33405, Talence Cedex, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LaBRI and Bordeaux1 Unix., Talence, France#TAB#","institution_ids":["https://openalex.org/I4210142254","https://openalex.org/I15057530","https://openalex.org/I4210160189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079033963"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.4075,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.82685407,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"231","issue":"2","first_page":"309","last_page":"334"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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.9987999796867371,"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.9987999796867371,"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/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.903130054473877},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7803409099578857},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7049962282180786},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.640128493309021},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.6108298301696777},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5733469128608704},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.570961058139801},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5608239769935608},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.5315898060798645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5164444446563721},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.46934783458709717},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4534376859664917},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.4442315995693207},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3732098937034607},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.34691566228866577},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28857284784317017},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.23774456977844238},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.22247615456581116},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.2124379575252533},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21106120944023132},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1990092694759369},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1388256549835205},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.09967926144599915},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.09895351529121399}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.903130054473877},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7803409099578857},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7049962282180786},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.640128493309021},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.6108298301696777},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5733469128608704},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.570961058139801},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5608239769935608},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.5315898060798645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5164444446563721},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.46934783458709717},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4534376859664917},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.4442315995693207},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3732098937034607},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.34691566228866577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28857284784317017},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.23774456977844238},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.22247615456581116},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.2124379575252533},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21106120944023132},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1990092694759369},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1388256549835205},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.09967926144599915},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.09895351529121399},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(99)00106-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(99)00106-1","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W61385686","https://openalex.org/W258022877","https://openalex.org/W956032893","https://openalex.org/W1485757985","https://openalex.org/W1503973138","https://openalex.org/W1506437980","https://openalex.org/W1518704718","https://openalex.org/W1525520647","https://openalex.org/W1527958538","https://openalex.org/W1535681052","https://openalex.org/W1547562281","https://openalex.org/W1562818191","https://openalex.org/W1584587517","https://openalex.org/W1606808306","https://openalex.org/W1979853884","https://openalex.org/W1996761984","https://openalex.org/W2025666838","https://openalex.org/W2028072917","https://openalex.org/W2042113833","https://openalex.org/W2051521505","https://openalex.org/W2065109782","https://openalex.org/W2065783614","https://openalex.org/W2077119345","https://openalex.org/W2079625718","https://openalex.org/W2118539487","https://openalex.org/W2136937307","https://openalex.org/W2138693669","https://openalex.org/W2157390113","https://openalex.org/W2545845195","https://openalex.org/W2587303304","https://openalex.org/W4210678036","https://openalex.org/W4241604193","https://openalex.org/W4244180300","https://openalex.org/W6600108290","https://openalex.org/W6733309412"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W127918926","https://openalex.org/W2089141720","https://openalex.org/W214992615","https://openalex.org/W1972232894","https://openalex.org/W2171067235","https://openalex.org/W2068249429","https://openalex.org/W4206600150"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}