{"id":"https://openalex.org/W1527958538","doi":"https://doi.org/10.1007/bfb0055780","title":"The equivalence problem for deterministic pushdown transducers into abelian groups","display_name":"The equivalence problem for deterministic pushdown transducers into abelian groups","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1527958538","doi":"https://doi.org/10.1007/bfb0055780","mag":"1527958538"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0055780","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0055780","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/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/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"G\u00e9raud S\u00e9nizergues","raw_affiliation_strings":["LaBRI, Universit\u00e9 de Bordeaux I, 351, Cours de la Lib\u00e9ration, 33405, Talence, France","Universite de Bordeaux I"],"affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 de Bordeaux I, 351, Cours de la Lib\u00e9ration, 33405, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254"]},{"raw_affiliation_string":"Universite de Bordeaux I","institution_ids":["https://openalex.org/I15057530"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079033963"],"corresponding_institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0116,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73370998,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"305","last_page":"315"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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.9997000098228455,"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/T10304","display_name":"Geometric and Algebraic Topology","score":0.9706000089645386,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10911","display_name":"Chemical Synthesis and Analysis","score":0.9635000228881836,"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/free-monoid","display_name":"Free monoid","score":0.7972842454910278},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7370527982711792},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.7159801125526428},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6695585250854492},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.637064516544342},{"id":"https://openalex.org/keywords/monoid","display_name":"Monoid","score":0.5655872225761414},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.4503057897090912},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.4175073504447937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39635634422302246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39344465732574463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3793541491031647},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30875131487846375},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.1501505970954895},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13477537035942078},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.09482619166374207},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.08850017189979553},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06885164976119995}],"concepts":[{"id":"https://openalex.org/C149685015","wikidata":"https://www.wikidata.org/wiki/Q5500266","display_name":"Free monoid","level":3,"score":0.7972842454910278},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7370527982711792},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.7159801125526428},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6695585250854492},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.637064516544342},{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.5655872225761414},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4503057897090912},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.4175073504447937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39635634422302246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39344465732574463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3793541491031647},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30875131487846375},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.1501505970954895},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13477537035942078},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.09482619166374207},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.08850017189979553},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06885164976119995},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"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},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bfb0055780","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0055780","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1506437980","https://openalex.org/W1555579046","https://openalex.org/W1982755473","https://openalex.org/W2011708147","https://openalex.org/W2028072917","https://openalex.org/W2031096385","https://openalex.org/W2036112364","https://openalex.org/W2042113833","https://openalex.org/W2065109782","https://openalex.org/W2065783614","https://openalex.org/W2070333917","https://openalex.org/W2111270089","https://openalex.org/W2135016001","https://openalex.org/W2135087766","https://openalex.org/W2170953202"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W1991406344","https://openalex.org/W392685101","https://openalex.org/W2012479020","https://openalex.org/W1537446812","https://openalex.org/W1486486721","https://openalex.org/W2472752294","https://openalex.org/W4280598225","https://openalex.org/W4313593731","https://openalex.org/W1511851241"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}