{"id":"https://openalex.org/W2167567138","doi":"https://doi.org/10.1007/978-3-540-71389-0_13","title":"Tree Automata with Memory, Visibility and Structural Constraints","display_name":"Tree Automata with Memory, Visibility and Structural Constraints","publication_year":2007,"publication_date":"2007-07-01","ids":{"openalex":"https://openalex.org/W2167567138","doi":"https://doi.org/10.1007/978-3-540-71389-0_13","mag":"2167567138"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-71389-0_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-540-71389-0_13.pdf","source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"book-chapter","type_crossref":"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/A5027210933","display_name":"Hubert Comon-Lundh","orcid":null},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hubert Comon-Lundh","raw_affiliation_strings":["LSV & ENS Cachan,"],"affiliations":[{"raw_affiliation_string":"LSV & ENS Cachan,","institution_ids":["https://openalex.org/I11559806"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068320028","display_name":"Florent Jacquemard","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Florent Jacquemard","raw_affiliation_strings":["INRIA Futurs & LSV,"],"affiliations":[{"raw_affiliation_string":"INRIA Futurs & LSV,","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107304346","display_name":"Nicolas Perrin","orcid":"https://orcid.org/0000-0003-2358-2915"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Perrin","raw_affiliation_strings":["ENS Lyon,"],"affiliations":[{"raw_affiliation_string":"ENS Lyon,","institution_ids":["https://openalex.org/I113428412"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.781,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.641875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":84,"max":85},"biblio":{"volume":null,"issue":null,"first_page":"168","last_page":"182"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994,"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/T11567","display_name":"semigroups and automata theory","score":0.9989,"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.9968,"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/tree-automaton","display_name":"Tree automaton","score":0.54915404},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.5032713},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4622732},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42580062}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7024354},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.613996},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.60682774},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.54915404},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.5032713},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4622732},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4472144},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42580062},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41738397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3415913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3332826},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22407123},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-71389-0_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-540-71389-0_13.pdf","source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.84,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":23,"referenced_works":["https://openalex.org/W1022217070","https://openalex.org/W1556566737","https://openalex.org/W1593799327","https://openalex.org/W1604924060","https://openalex.org/W160847359","https://openalex.org/W170035804","https://openalex.org/W1807703763","https://openalex.org/W1827592073","https://openalex.org/W1965061701","https://openalex.org/W1967744155","https://openalex.org/W1974542856","https://openalex.org/W1990748319","https://openalex.org/W2055893308","https://openalex.org/W2132750992","https://openalex.org/W2133563196","https://openalex.org/W2137370934","https://openalex.org/W2151033407","https://openalex.org/W2486684896","https://openalex.org/W2561675875","https://openalex.org/W2607230115","https://openalex.org/W2912818154","https://openalex.org/W4237164190","https://openalex.org/W4391979734"],"related_works":["https://openalex.org/W3104737963","https://openalex.org/W2742582826","https://openalex.org/W2506746226","https://openalex.org/W2182252111","https://openalex.org/W2109489765","https://openalex.org/W2021535402","https://openalex.org/W1886746238","https://openalex.org/W1582302366","https://openalex.org/W1541953080","https://openalex.org/W1537446812"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2167567138","counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2024-12-07T19:53:22.582806","created_date":"2016-06-24"}
